一、讲座题目
Anonymous Public Announcements
二、主讲人
Thomas Ågotnes
三、主讲人简介
Thomas Ågotnes是挪威卑尔根大学教授、山西大学兼职教授。研究方向聚焦多主体系统、认知逻辑、博弈论与社会选择、社会网络等交叉领域。在Artificial Intelligence、Studia Logica、Synthese、AAAI、IJCAI等顶尖期刊及权威会议发表论文百余篇，含多项最佳论文奖，获挪威“研究进步奖”。现任EURAMAS、挪威人工智能学会理事，CLIMA、LAMAS等国际会议指导委员会委员。
四、讲座简介
I formalise the notion of an anonymous public announcement in the tradition of public announcement logic. Such announcements can be seen as in-between a public announcement from“the outside" (an announcement of ϕ) and a public announcement by one of the agents (an announcement of Kaϕ): we get more information than just ϕ, but not (necessarily) about exactly who made it. Even if such an announcement is prima facie anonymous, depending on the background knowledge of the agents it might reveal the identity of the announcer: if I post some thing on a message board, the information might reveal who I am even if I don’t sign my name. Furthermore, like in the Russian Cards puzzle, if we assume that the announcer’s intention was to stay anonymous, that in fact might reveal more information. In this talk I first look at the case when no assumption about intentions are made, in which case the logic with an anonymous public announcement operator is reducible to epistemic logic. I then look at the case when we assume common knowledge of the intention to stay anonymous, which is both more complex and more interesting: in several ways it boils down to the notion of a “safe" announcement (again, similarly to Russian Cards). Main results include formal expressivity results and axiomatic completeness for key logical languages. The talk is based on joint work with Rustam Galimullin, Ken Satoh and Satoshi Tojo.
五、主持人
开车漫画
哲学系 王文方教授
六、讲座时间
2026年1月8日（星期四）15：00——17：00
七、讲座地点
开车漫画
中心校区知新楼A1618
