Towards tractable Boolean games

@inproceedings{Dunne2012TowardsTB,
  title={Towards tractable Boolean games},
  author={Paul E. Dunne and Michael Wooldridge},
  booktitle={AAMAS},
  year={2012}
}
Boolean games are a compact and expressive class of games, based on propositional logic. However, Boolean games are computationally complex: checking for the existence of pure Nash equilibria in Boolean games is Σp2-complete, and it is co-NP-complete to check whether a given outcome for a Boolean game is a pure Nash equilibrium. In this paper, we consider two possible avenues to tractability in Boolean games. First, we consider the development of alternative solution concepts for Boolean games… CONTINUE READING