Belief revision games (BRGs) are concerned with the dynamics of the beliefs of a group of communicating agents. BRGs are “zero-player” games where at each step every agent revises her own beliefs by taking account for the beliefs of her acquaintances. Each agent is associated with a belief state defined on some finite propositional language. We provide a general definition for such games where each agent has her own revision policy, and show that the belief sequences of agents can always be finitely characterized. We then define a set of revision policies based on belief merging operators. We point out a set of appealing properties for BRGs and investigate the extent to which these properties are satisfied by the merging-based policies under consideration.

  • The BRG Software: Zipped autoexecutable jar file (Java) Decompress the zip file to get the auto-executable jar file. Run with java -jar brg.jar
  • The corresponding AAAI’15 paper Belief Revision Games: PDF
  • The long version of the paper, including proofs: PDF
  • The long version of the IJCAI16 paper Is Promoting Beliefs Useful to Make Them Accepted in Networks of Agents?: PDF

Authors :
Nicolas Schwind
Katsumi Inoue
Gauvain Bourgne
Sébastien Konieczny
Pierre Marquis

Any category    Reasoning   


International conferences

2016 Nicolas Schwind, Katsumi Inoue, Gauvain Bourgne, Sébastien Konieczny, Pierre Marquis, Is Promoting Beliefs Useful to Make Them Accepted in Networks of Agents? in Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, pp. 1237-1243, 2016.