Iterated Boolean games

Julian Gutierrez, Paul Harrenstein, Michael Wooldridge

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

18 Citations (Scopus)


Iterated games are well-known in the game theory literature. We study iterated Boolean games. These are games in which players repeatedly choose truth values for Boolean variables they have control over. Our model of iterated Boolean games assumes that players have goals given by formulae of Linear Temporal Logic (LTL), a formalism for expressing properties of state sequences. In order to model the strategies that players use in such games, we use a finite state machine model. After introducing and formally defining iterated Boolean games, we investigate the computational complexity of their associated game-theoretic decision problems as well as semantic conditions characterising classes of LTL properties that are preserved by pure strategy Nash equilibria whenever they exist.

Original languageEnglish
Title of host publicationIJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence
PublisherAssociation for the Advancement of Artificial Intelligence (AAAI)
Number of pages7
ISBN (Print)9781577356332
Publication statusPublished - 2013
Externally publishedYes
EventInternational Joint Conference on Artificial Intelligence 2013 - Beijing, China
Duration: 3 Aug 20139 Aug 2013
Conference number: 23rd (conference proceedings)

Publication series

NameIJCAI International Joint Conference on Artificial Intelligence
ISSN (Print)1045-0823


ConferenceInternational Joint Conference on Artificial Intelligence 2013
Abbreviated titleIJCAI 2013
Internet address

Cite this