Using Answer Set Programming for Solving Boolean Games

Sofie De Clercq, Martine De Cock, Kim Bauters, Steven Schockaert, Ann Nowé

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

3 Citations (Scopus)

Abstract

Boolean games are a framework for reasoning about the rational behaviour of agents, whose goals are formalized using propositional formulas. They offer an attractive alternative to normal-form games, because they allow for a more intuitive and more compact encoding. Unfortunately, however, there is currently no general, tailor-made method available to compute the equilibria of Boolean games. In this paper, we introduce a method for finding the pure Nash equilibria based on disjunctive answer set programming. Our method is furthermore capable of finding the core elements and the Pareto optimal equilibria, and can easily be modified to support other forms of optimality, thanks to the declarative nature of disjunctive answer set programming. Experimental results clearly demonstrate the effectiveness of the proposed method.
Original languageEnglish
Title of host publicationProceedings, Fourteenthh International Conference on Principles of Knowledge Representation and Reasoning (KR-14)
EditorsChitta Baral, Giuseppe De Giancomo, Thomas Eiter
PublisherAAAI Press
Pages602-605
Number of pages4
ISBN (Print)978-1-57735-657-8 , 1577356578
Publication statusPublished - Jul 2014
Event14th International Conference on Principles of Knowledge Representation and Reasoning - Vienna, Austria
Duration: 20 Jul 201424 Jul 2014

Conference

Conference14th International Conference on Principles of Knowledge Representation and Reasoning
Country/TerritoryAustria
CityVienna
Period20/07/201424/07/2014

Cite this