Taxation search in boolean games Conference Paper uri icon


  • Agents in a Boolean game have a personal goal represented as a propositional logic formula over a set of Boolean variables, where some of these variables are not necessarily held by the agent. The actions available to each agent are assumed to have some cost, and the agent's secondary goal is to minimize its costs. An interesting problem is to find a taxation scheme that imposes additional costs on the agents' actions such that it incentivizes the agents to reach a stable state. The present paper first theoretically outlines the characteristics of Boolean games for which stabilization can be achieved by applying a taxation scheme. Next, a search method for an appropriate taxation scheme is proposed. The proposed method transforms the Boolean game into an Asymmetric Distributed Constraint Optimization Problem (ADCOP). ADCOPs are a natural representation of …

publication date

  • January 1, 2013