Information Tracking in Games on Graphs


Abstract
When seeking to coordinate in a game with imperfect information, it is often relevant for a player to know what other players know. Keeping track of the information acquired in a play of infinite duration may, however, lead to infinite hierarchies of higher-order knowledge. We present a construction that makes explicit which higher-order knowledge is relevant in a game and allows us to describe a class of games that admit coordinated winning strategies with finite memory
Keywords Infinite games  Imperfect information  Distributed strategies  Multiplayer games
Categories (categorize this paper)
DOI 10.1007/s10849-009-9115-8
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 40,736
Through your library

References found in this work BETA

Infinite Games Played on Finite Graphs.Robert McNaughton - 1993 - Annals of Pure and Applied Logic 65 (2):149-184.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2010-01-13

Total views
23 ( #357,699 of 2,243,777 )

Recent downloads (6 months)
1 ( #1,042,515 of 2,243,777 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature