LPOD answer sets and nash equilibria

作者: Norman Foo , Thomas Meyer , Gerhard Brewka

DOI: 10.1007/978-3-540-30502-6_25

关键词:

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

参考文章(6)
Marina De Vos, Dirk Vermeir, Choice Logic Programs and Nash Equilibria in Strategic Games computer science logic. pp. 266- 276 ,(1999) , 10.1007/3-540-48168-0_19
Herbert A. Simon, R. Duncan Luce, Howard Raiffa, GAMES AND DECISIONS; INTRODUCTION AND CRITICAL SURVEY. American Sociological Review. ,vol. 23, pp. 342- ,(1958) , 10.2307/2089260
Gerhard Brewka, Answer Sets and Qualitative Decision Making Synthese. ,vol. 146, pp. 171- 187 ,(2005) , 10.1007/S11229-005-9084-7
Michael Gelfond, Vladimir Lifschitz, Classical negation in logic programs and disjunctive databases New Generation Computing. ,vol. 9, pp. 365- 385 ,(1991) , 10.1007/BF03037169
Vincent Danos, Jean-Louis Krivine, Disjunctive Tautologies as Synchronisation Schemes computer science logic. pp. 292- 301 ,(2000) , 10.1007/3-540-44622-2_19