Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns

Sofie De Clercq, Kim Bauters, Steven Schockaert, Mihail Mihaylov, Martine De Cock, Ann Nowe

2014

Abstract

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.

Download


Paper Citation


in Harvard Style

De Clercq S., Bauters K., Schockaert S., Mihaylov M., De Cock M. and Nowe A. (2014). Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns . In Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART, ISBN 978-989-758-016-1, pages 50-59. DOI: 10.5220/0004811700500059

in Bibtex Style

@conference{icaart14,
author={Sofie De Clercq and Kim Bauters and Steven Schockaert and Mihail Mihaylov and Martine De Cock and Ann Nowe},
title={Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns },
booktitle={Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,},
year={2014},
pages={50-59},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004811700500059},
isbn={978-989-758-016-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 6th International Conference on Agents and Artificial Intelligence - Volume 2: ICAART,
TI - Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns
SN - 978-989-758-016-1
AU - De Clercq S.
AU - Bauters K.
AU - Schockaert S.
AU - Mihaylov M.
AU - De Cock M.
AU - Nowe A.
PY - 2014
SP - 50
EP - 59
DO - 10.5220/0004811700500059