Decentralized computation of pareto optimal pure nash equilibria of boolean games with privacy concerns

De Clercq, Sofie, Bauters, Kim, Schockaert, Steven ORCID: https://orcid.org/0000-0002-9256-2881, Mihaylov, Mihail, De Cock, Martine and Nowe, Ann 2014. Decentralized computation of pareto optimal pure nash equilibria of boolean games with privacy concerns. Presented at: International Conference on Agents and Artificial Intelligence (ICAART 2014), Angers, France, 6-8 March 2014. Published in: Duval, Beatrice, van den Herik, Jaap, Loiseau, Stephane and Filipe, Joaquim eds. Issue Proceedings ICAART 2014. , vol.2 pp. 50-59. 10.5220/0004811700500059

Full text not available from this repository.

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.

Item Type:	Conference or Workshop Item (Paper)
Date Type:	Publication
Status:	Published
Schools:	Computer Science & Informatics
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Uncontrolled Keywords:	Boolean Games, Pure Nash Equilibria, Decentralized Learning.
Last Modified:	27 Oct 2022 10:01
URI:	https://orca.cardiff.ac.uk/id/eprint/68589

Citation Data

Cited 4 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item