Title:

Complexity of mixed equilibria in Boolean games

Boolean games are a succinct representation of strategic games wherein a player seeks to satisfy a formula of propositional logic by selecting a truth assignment to a set of propositional variables under his control. The difficulty arises because a player does not necessarily control every variable on which his formula depends, hence the satisfaction of his formula will depend on the assignments chosen by other players, and his own choice of assignment will affect the satisfaction of other players' formulae. The framework has proven popular within the multiagent community and the literature is replete with papers either studying the properties of such games, or using them to model the interaction of selfinterested agents. However, almost invariably, the work to date has been restricted to the case of pure strategies. Such a focus is highly restrictive as the notion of randomised play is fundamental to the theory of strategic game  even very simple games can fail to have purestrategy equilibria, but every finite game has at least one equilibrium in mixed strategies. To address this, the present work focuses on the complexity of algorithmic problems dealing with mixed strategies in Boolean games. The main result is that the problem of determining whether a twoplayer game has an equilibrium satisfying a given payoff constraint is NEXPcomplete. Based on this result, we then demonstrate that a number of other decision problems, such as the uniqueness of an equilibrium or the satisfaction of a given formula in equilibrium, are either NEXP or coNEXPcomplete. The proof techniques developed in the course of this are then used to show that the problem of deciding whether a given profile is in equilibrium is coNP#Phard, and the problem of deciding whether a Boolean game has a rationalvalued equilibrium is NEXPhard, and whether a twoplayer Boolean game has an irrationalvalued equilibrium is NEXPcomplete. Finally, we show that determining whether the value of a twoplayer zerosum game exceeds a given threshold is EXPcomplete.
