Partial-order Boolean games: informational independence in a logic-based model of strategic interaction

DOI10.1007/s11229-015-0991-yzbMath1397.91017OpenAlexW2289844433MaRDI QIDQ516248

Julian Gutierrez, Julian Bradfield, Michael Wooldridge

Publication date: 14 March 2017

Published in: Synthese (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/23797789/main.pdf

zbMATH Keywords

independence-friendly logicBoolean gamesconcurrency theoryfoundations of games

Mathematics Subject Classification ID

Noncooperative games (91A10) Applications of game theory (91A80) Other nonclassical logic (03B60) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Partial order games ⋮ Reasoning about causality in games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incentive engineering for Boolean games
• Models for concurrency: Towards a classification
• Dependencies between players in Boolean games
• Undecidability of domino games and hhp-bisimilarity.
• Multi-agent influence diagrams for representing and solving games.
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Deterministic concurrent strategies
• Henkin quantifiers and Boolean formulae: a certification perspective of DQBF
• The Winning Ways of Concurrent Games
• Concurrent Logic Games on Partial Orders
• Weighted Boolean Formula Games
• Asynchronous Games: Innocence Without Alternation
• Sequentiality vs. concurrency in games and logic
• Equilibria of concurrent games on event structures
• Imperfect Information in Logic and Concurrent Games
• Lower bounds for multiplayer noncooperative games of incomplete information