LPOD answer sets and nash equilibria

Authors:
Norman Foo;Thomas Meyer;Gerhard Brewka
Affiliations:
National ICT Australia/ and The School of Computer Science and Engineering, University of New South Wales, Sydney, Australia;National ICT Australia/ and The School of Computer Science and Engineering, University of New South Wales, Sydney, Australia;Intelligent Systems Department, Computer Science Institute, University of Leipzig, Leipzig, Germany
Venue:
ASIAN'04 Proceedings of the 9th Asian Computing Science conference on Advances in Computer Science: dedicated to Jean-Louis Lassez on the Occasion of His 5th Cycle Birthday
Year:
2004

Citing 1
Cited 9

Choice Logic Programs and Nash Equilibria in Strategic Games

CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic

Compact preference representation and Boolean games

Autonomous Agents and Multi-Agent Systems
Boolean games revisited

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Compact preference representation for boolean games

PRICAI'06 Proceedings of the 9th Pacific Rim international conference on Artificial intelligence
Forgetting in logic programs with ordered disjunction

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
A logical characterisation of ordered disjunction

AI Communications - Answer Set Programming
Aggregates in answer set optimization

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Preferences in answer set programming

CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
Possibilistic semantics for logic programs with ordered disjunction

FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Fuzzy Equilibrium Logic: Declarative Problem Solving in Continuous Domains

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Logic programs with ordered disjunctions (LPODs) are natural vehicles for expressing choices that have a preference ordering. They are extensions of the familiar extended logic programs that have answer sets as semantics. In game theory, players usually prefer strategies that yield higher payoffs. Since strategies are choices, LPODs would seem to be a suitable logical formalism for expressing some game-theoretic properties. This paper shows how pure strategy normal form games can be encoded as LPODs in such a way that the answer sets that are mutually most preferred by all players are exactly the Nash equilibria. A similar result has been obtained by researchers using a different, but related, logical formalism, viz., ordered choice logic programs that were used to encode extensive games.