Iterated Boolean games

Julian Gutierrez; Paul Harrenstein; Michael Wooldridge

Iterated Boolean games

Julian Gutierrez, Paul Harrenstein, Michael Wooldridge

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

Abstract

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 language	English
Title of host publication	IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence
Publisher	Association for the Advancement of Artificial Intelligence (AAAI)
Pages	932-938
Number of pages	7
ISBN (Print)	9781577356332
Publication status	Published - 2013
Externally published	Yes
Event	International Joint Conference on Artificial Intelligence 2013 - Beijing, China Duration: 3 Aug 2013 → 9 Aug 2013 Conference number: 23rd http://ijcai-13.org/ https://www.ijcai.org/proceedings/2013 (conference proceedings)

Publication series

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

Conference

Conference	International Joint Conference on Artificial Intelligence 2013
Abbreviated title	IJCAI 2013
Country/Territory	China
City	Beijing
Period	3/08/13 → 9/08/13
Internet address	http://ijcai-13.org/ https://www.ijcai.org/proceedings/2013 (conference proceedings)

Cite this

@inproceedings{f446cee3d4c34ebaa3edd27462326825,

title = "Iterated Boolean games",

abstract = "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.",

author = "Julian Gutierrez and Paul Harrenstein and Michael Wooldridge",

year = "2013",

language = "English",

isbn = "9781577356332",

series = "IJCAI International Joint Conference on Artificial Intelligence",

publisher = "Association for the Advancement of Artificial Intelligence (AAAI)",

pages = "932--938",

booktitle = "IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence",

address = "United States of America",

note = "International Joint Conference on Artificial Intelligence 2013, IJCAI 2013 ; Conference date: 03-08-2013 Through 09-08-2013",

url = "http://ijcai-13.org/, https://www.ijcai.org/proceedings/2013",

}

Gutierrez, J, Harrenstein, P & Wooldridge, M 2013, Iterated Boolean games. in IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. IJCAI International Joint Conference on Artificial Intelligence, Association for the Advancement of Artificial Intelligence (AAAI), pp. 932-938, International Joint Conference on Artificial Intelligence 2013, Beijing, China, 3/08/13.

Iterated Boolean games. / Gutierrez, Julian; Harrenstein, Paul; Wooldridge, Michael.
IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence. Association for the Advancement of Artificial Intelligence (AAAI), 2013. p. 932-938 (IJCAI International Joint Conference on Artificial Intelligence).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Iterated Boolean games

AU - Gutierrez, Julian

AU - Harrenstein, Paul

AU - Wooldridge, Michael

N1 - Conference code: 23rd

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84896058994&partnerID=8YFLogxK

M3 - Conference Paper

AN - SCOPUS:84896058994

SN - 9781577356332

T3 - IJCAI International Joint Conference on Artificial Intelligence

SP - 932

EP - 938

BT - IJCAI 2013 - Proceedings of the 23rd International Joint Conference on Artificial Intelligence

PB - Association for the Advancement of Artificial Intelligence (AAAI)

T2 - International Joint Conference on Artificial Intelligence 2013

Y2 - 3 August 2013 through 9 August 2013

ER -

Iterated Boolean games

Abstract

Publication series

Conference

Other files and links

Research output

Iterated Boolean games

Cite this