Iterated Boolean games
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...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2015
|
| _version_ | 1826312023386882048 |
|---|---|
| author | Gutierrez, J Harrenstein, B Wooldridge, M |
| author_facet | Gutierrez, J Harrenstein, B Wooldridge, M |
| author_sort | Gutierrez, J |
| collection | OXFORD |
| description | 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 represent the strategies of players 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 equilibrium points (pure-strategy Nash equilibria) whenever they exist. |
| first_indexed | 2024-03-07T08:20:01Z |
| format | Journal article |
| id | oxford-uuid:53fc715e-3afb-4bba-a716-cefe55809f93 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T08:20:01Z |
| publishDate | 2015 |
| publisher | Elsevier |
| record_format | dspace |
| spelling | oxford-uuid:53fc715e-3afb-4bba-a716-cefe55809f932024-01-29T08:43:59ZIterated Boolean gamesJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:53fc715e-3afb-4bba-a716-cefe55809f93EnglishSymplectic Elements at OxfordElsevier2015Gutierrez, JHarrenstein, BWooldridge, MIterated 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 represent the strategies of players 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 equilibrium points (pure-strategy Nash equilibria) whenever they exist. |
| spellingShingle | Gutierrez, J Harrenstein, B Wooldridge, M Iterated Boolean games |
| title | Iterated Boolean games |
| title_full | Iterated Boolean games |
| title_fullStr | Iterated Boolean games |
| title_full_unstemmed | Iterated Boolean games |
| title_short | Iterated Boolean games |
| title_sort | iterated boolean games |
| work_keys_str_mv | AT gutierrezj iteratedbooleangames AT harrensteinb iteratedbooleangames AT wooldridgem iteratedbooleangames |