The complexity of decision problems about equilibria in two-player Boolean games

DOI10.1016/j.artint.2018.04.006zbMath1452.91012OpenAlexW2806425558MaRDI QIDQ1648073

Luke Ong, Egor Ianovski

Publication date: 27 June 2018

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:55d54673-1ded-4092-8a69-ec2c3a6b3b2f

zbMATH Keywords

complexitygame theorypropositional logicBoolean games

Mathematics Subject Classification ID

2-person games (91A05) Decision theory for games (91A35) Algorithmic game theory and complexity (91A68)

Related Items (2)

Equilibria for games with combined qualitative and quantitative objectives ⋮ Behavioural strategies in weighted Boolean games

Cites Work

• Nash and correlated equilibria: Some complexity considerations
• Non-cooperative games
• The Computational Complexity of Nash Equilibria in Concisely Represented Games
• Logics in Artificial Intelligence
• Unnamed Item

This page was built for publication: The complexity of decision problems about equilibria in two-player Boolean games