Infinite Games with Uncertain Moves

Nicholas Asher (1, 2) , Soumya Paul (1)

1 IRIT-MELODI - MEthodes et ingénierie des Langues, des Ontologies et du DIscours
2 CNRS - Centre National de la Recherche Scientifique

We study infinite two-player games where one of the players is unsure about the set of moves available to the other player. In particular, the set of moves of the other player is a strict superset of what she assumes it to be. We explore what happens to sets in various levels of the Borel hierarchy under such a situation. We show that the sets at every alternate level of the hierarchy jump to the next higher level.

Mots clés: Game Theory

Domaines: Intelligence artificielle [cs.AI]; Apprentissage [cs.LG]; Logique en informatique [cs.LO]; Informatique et langage [cs.CL]

Nicholas Asher, Soumya Paul. Infinite Games with Uncertain Moves. Strategic Reasoning Workshop, European Joint Conference on Theory and Practice of Software (2013), Mar 2013, Rome, Italy. pp. 25-32. ⟨hal-01212863⟩