Advertisement

Qualitative Model of Game Theory

  • Rafał Graboś
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3558)

Abstract

This paper studies the notion of qualitative game theory in the context of multi-agent decision making. We use logic programs with ordered disjunction (LPODs), invented by Brewka, as representation and reasoning language for strategic form of games. Structure and rules of a game are represented as a LPODin which preferences of players are encoded as ordered disjunctive rules. Solution of a game is defined in terms of equilibria such that preferred answer sets of a LPOD representing a game correspond exactly to respective types of equilibria of the game. We also discuss games in which rules have been changed or players are wrong informed about the rules of a game.

Keywords

Nash Equilibrium Logic Program Logic Programming Strategy Profile Extended Logic Program 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Benferhat, S., et al.: Towards a possibilistic logic handling of preferences. Applied Intelligence 14, 303–317 (2001)zbMATHCrossRefGoogle Scholar
  2. 2.
    Brewka, G.: Logic Programs with Ordered Disjunction. In: Proc. AAAI, Canada, pp. 100–105 (2002)Google Scholar
  3. 3.
    Brewka, G.: Implementing Ordered Disjunction Using Answer Set Solvers for Normal Programs. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 444–455. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Doyle, J., Thomason, R.: Background to qualitative decision theory. AI. Mag. 20, 55–68 (1997)Google Scholar
  5. 5.
    Dastani, M., Van der Torre, L.: What is a joint goal? Games with beliefs and defeasible desires. In: NMR 2002, France, pp. 33–40 (2002)Google Scholar
  6. 6.
    De Vos, M., Vermeir, D.: Choice Logic Programs and Nash Equilibria in Strategic Games. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 266–276. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  7. 7.
    De Vos, M., Vermeir, D.: Logic Programming Agents and Game Theory. In: Proc. AAAI Spring Symposium on Answer Set Programming, USA, pp. 27–33 (2001)Google Scholar
  8. 8.
    De Vos, M., Vermeir, D.: Dynamic Decision Making in Logic Programming and Game Theory. In: AI 2002, Australia, pp. 36–57 (2002)Google Scholar
  9. 9.
    Grabos, R.: Qualitative Model of Decision Making. In: Bussler, C.J., Fensel, D. (eds.) AIMSA 2004. LNCS (LNAI), vol. 3192, pp. 480–489. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  10. 10.
    Lifschitz, V.: Answer set programming and plan generation. AI 138, 39–54 (2002)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Niemelä, I., Simons, P.: Smodels-an implementation of the stable model and well-founded semantics for normal logic programs. In: Fuhrbach, U., Dix, J., Nerode, A. (eds.) LPNMR 1997. LNCS, vol. 1265, pp. 420–429. Springer, Heidelberg (1997)Google Scholar
  12. 12.
    Tennenholtz, M.: On Stable Social Laws and Qualitative Equilibria. AI 102, 1–20 (1998)zbMATHMathSciNetGoogle Scholar
  13. 13.
    Osorio, M. et.al.: Generalized Ordered Disjunction and its Applications (not published) Google Scholar
  14. 14.
    Tan, S.W., Pearl, J.: Qualitative Decision Theory. In: Proc. AAAI 1994, USA, pp. 70–75 (1994)Google Scholar
  15. 15.
    Von Neumann, J., Morgenstern, O.: Theory of Games and Economic Behavior, 2nd edn. Princeton University Press, Princeton (1944)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Rafał Graboś
    • 1
  1. 1.Dept. of Computer ScienceUniversity of LeipzigGermany

Personalised recommendations