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 Nowé

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationProceedings of the 6th International Conference on Agents and Artificial Intelligence (ICAART)
EditorsBeatrice Duval, Jaap van der Herik, Stephane Loiseau, Joaquim Filipe
PublisherSciTePress
Pages50-59
Number of pages10
ISBN (Print)9789897580161
DOIs
Publication statusPublished - 2014
Event6th International Conference on Agents and Artifcial Intelligence - Angers, France
Duration: 06 Mar 201408 Mar 2014

Conference

Conference6th International Conference on Agents and Artifcial Intelligence
CountryFrance
CityAngers
Period06/03/201408/03/2014

Fingerprint

Reinforcement learning
Acoustic waves
Communication

Bibliographical note

short-listed for best student paper at ICAART'14

Cite this

Clercq, S. D., Bauters, K., Schockaert, S., Mihaylov, M., Cock, M. D., & Nowé, A. (2014). Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns. In B. Duval, J. van der Herik, S. Loiseau, & J. Filipe (Eds.), Proceedings of the 6th International Conference on Agents and Artificial Intelligence (ICAART) (pp. 50-59). SciTePress. https://doi.org/10.5220/0004811700500059
Clercq, Sofie De ; Bauters, Kim ; Schockaert, Steven ; Mihaylov, Mihail ; Cock, Martine De ; Nowé, Ann. / Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns. Proceedings of the 6th International Conference on Agents and Artificial Intelligence (ICAART). editor / Beatrice Duval ; Jaap van der Herik ; Stephane Loiseau ; Joaquim Filipe. SciTePress, 2014. pp. 50-59
@inproceedings{5554ce3490fc47c08f750c1973029be0,
title = "Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns",
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.",
author = "Clercq, {Sofie De} and Kim Bauters and Steven Schockaert and Mihail Mihaylov and Cock, {Martine De} and Ann Now{\'e}",
note = "short-listed for best student paper at ICAART'14",
year = "2014",
doi = "10.5220/0004811700500059",
language = "English",
isbn = "9789897580161",
pages = "50--59",
editor = "Beatrice Duval and {van der Herik}, Jaap and Stephane Loiseau and Joaquim Filipe",
booktitle = "Proceedings of the 6th International Conference on Agents and Artificial Intelligence (ICAART)",
publisher = "SciTePress",

}

Clercq, SD, Bauters, K, Schockaert, S, Mihaylov, M, Cock, MD & Nowé, A 2014, Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns. in B Duval, J van der Herik, S Loiseau & J Filipe (eds), Proceedings of the 6th International Conference on Agents and Artificial Intelligence (ICAART). SciTePress, pp. 50-59, 6th International Conference on Agents and Artifcial Intelligence, Angers, France, 06/03/2014. https://doi.org/10.5220/0004811700500059

Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns. / Clercq, Sofie De; Bauters, Kim; Schockaert, Steven; Mihaylov, Mihail; Cock, Martine De; Nowé, Ann.

Proceedings of the 6th International Conference on Agents and Artificial Intelligence (ICAART). ed. / Beatrice Duval; Jaap van der Herik; Stephane Loiseau; Joaquim Filipe. SciTePress, 2014. p. 50-59.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

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

AU - Clercq, Sofie De

AU - Bauters, Kim

AU - Schockaert, Steven

AU - Mihaylov, Mihail

AU - Cock, Martine De

AU - Nowé, Ann

N1 - short-listed for best student paper at ICAART'14

PY - 2014

Y1 - 2014

N2 - 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.

AB - 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.

U2 - 10.5220/0004811700500059

DO - 10.5220/0004811700500059

M3 - Conference contribution

SN - 9789897580161

SP - 50

EP - 59

BT - Proceedings of the 6th International Conference on Agents and Artificial Intelligence (ICAART)

A2 - Duval, Beatrice

A2 - van der Herik, Jaap

A2 - Loiseau, Stephane

A2 - Filipe, Joaquim

PB - SciTePress

ER -

Clercq SD, Bauters K, Schockaert S, Mihaylov M, Cock MD, Nowé A. Decentralized Computation of Pareto Optimal Pure Nash Equilibria of Boolean Games with Privacy Concerns. In Duval B, van der Herik J, Loiseau S, Filipe J, editors, Proceedings of the 6th International Conference on Agents and Artificial Intelligence (ICAART). SciTePress. 2014. p. 50-59 https://doi.org/10.5220/0004811700500059