Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns
In Boolean games, agents try to reach a goal formulated as a Boolean formula. These games are attractive because of their compact representations. However, few methods are available to compute the solutions and they are either limited or do not take privacy or communication concerns into account. In this paper we propose the use of an algorithm related to reinforcement learning to address this problem. Our method is decentralized in the sense that agents try to achieve their goals without knowledge of the other agents’ goals. We prove that this is a sound method to compute a Pareto optimal pure Nash equilibrium for an interesting class of Boolean games. Experimental results are used to investigate the performance of the algorithm.
In Proceedings of ICAART 2014 (6th International Conference on Agents and Artificial Intelligence -- http://www.icaart.org ), 2014 Nominated for best student paper award