Incentive engineering for Boolean games

Michael Wooldridge (1) , Ulle Endriss (2) , Sarit Kraus (3) , Jérôme Lang (4)

1 Department of Computer Science [Oxford]
2 ILLC - Institute for Logic, Language and Computation
3 Department of Computer Science [Bar Ilan]
4 LAMSADE - Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision

Boolean games are a natural, compact, and expressive class of logic-based games, in which each player exercises unique control over some set of Boolean variables, and has some logical goal formula that it desires to be achieved. A playerʼs strategy set is the set of all possible valuations that may be made to its variables. A playerʼs goal formula may contain variables controlled by other agents, and in this case, it must reason strategically about how best to assign values to its variables. In the present paper, we consider the possibility of overlaying Boolean games with taxation schemes. A taxation scheme imposes a cost on every possible assignment an agent can make. By designing a taxation scheme appropriately, it is possible to perturb the preferences of agents so that they are rationally incentivised to choose some desirable equilibrium that might not otherwise be chosen, or incentivised to rule out some undesirable equilibria. After formally presenting the model, we explore some issues surrounding it (e.g., the complexity of finding a taxation scheme that implements some desirable outcome), and then discuss possible desirable properties of taxation schemes.

Mots clés: Taxation; Boolean games; Multi-agent systems; Manipulation

Domaines: Informatique [cs]

Michael Wooldridge, Ulle Endriss, Sarit Kraus, Jérôme Lang. Incentive engineering for Boolean games. Artificial Intelligence, 2013, 195, ⟨10.1016/j.artint.2012.11.003⟩. ⟨hal-01498579⟩