Advertisement

On Multi-agent Petri Net Models for Computing Extensive Finite Games

  • Rustam Tagiew
Part of the Studies in Computational Intelligence book series (SCI, volume 244)

Abstract

Modelling multi-agent strategic interactions by using Petri nets is the addressed issue. Strategic interactions are represented as games in extensive form. Representations in extensive form are known in artificial intelligence as game trees. We use transition systems of Petri nets to build game trees. Representable games are restricted to be finite and of complete information. A language for representation of these games is created and is expected to represent also time dependent aspects. Two perspectives of application are considered - game server definition and calculation of equilibria. The approach is compared with related works and its advantages are discussed. The most important advantages are the graphical representation in comparison to logic based approaches and the slenderness in comparison to default game representation in extensive form. Formal definition, algorithms and examples are given. An implementation is already tested.

Keywords

Imperfect Information Strategic Interaction Game State Game Tree Congestion Game 
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.
    Russel, S., Norvig, P.: Artificial Intelligence. Pearson Education, London (2003)Google Scholar
  2. 2.
    Osborne, M.J., Rubinstein, A.: A course in game theory. MIT Press, Cambridge (1994)Google Scholar
  3. 3.
    Nash, J.: Non-cooperative games. Annals of Mathematics (54), 286–295 (1951)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Grosz, B., Pfeffer, A.: Colored trails, http://www.eecs.harvard.edu/ai/ct/
  5. 5.
    Phelps, S.G.: Evolutionary Mechanism Design. PhD thesis, University of Liverpool (2007)Google Scholar
  6. 6.
    Tagiew, R.: Multi-agent petri-games. In: Mohammadian, M. (ed.) CIMCA 2008 – IAWTIC 2008 – ISE 2008. IEEE Computer Society Press, Los Alamitos (2009)Google Scholar
  7. 7.
    Kearns, M., Littman, M., Singh, S.: Graphical models for game theory. In: Proceedings of UAI (2001)Google Scholar
  8. 8.
    Leyton, K., Tennenholtz, M.: Local-effect games. In: IJCAI (2003)Google Scholar
  9. 9.
    Rosenthal, R.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory 2, 65–67 (1973)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Bhat, N., Leyton-Brown, K.: Computing nash equilibria of action-graph games. In: Proceedings of UAI (2004)Google Scholar
  11. 11.
    Clempner, J.: Modeling shortest path games with petri nets: a lyapunov based theory. Appl. Math. Comput. Sci. 16(3), 387–397 (2006)zbMATHMathSciNetGoogle Scholar
  12. 12.
    Kanovich, I.M.: Petri nets, horn programs, linear logic and vector games. Annals of Pure and Applied Logic 75 (1995)Google Scholar
  13. 13.
    Westergaard, M.: Game coloured petri nets. In: Seventh Workshop on Practical Use of Coloured Petri Nets and the CPN Tools (2006)Google Scholar
  14. 14.
    Koller, D., Pfeffer, A.: Representations and solutions for game-theoretic problems. Artificial Intelligence 94(1-2), 167–215 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Turocy, T.L.: Toward a black-box solver for finite games. In: IMA Software for Algebraic Geometry Workshop. Springer, Heidelberg (2008)Google Scholar
  16. 16.
    Genesereth, M.R., Love, N., Pell, B.: General game playing: Overview of the aaai competition. AI Magazine 26(2), 62–72 (2005)Google Scholar
  17. 17.
    Priese, L., Wimmel, H.: Petri-Netze. Springer, Heidelberg (2008)zbMATHGoogle Scholar
  18. 18.
    Tagiew, R.: Towards a framework for management of strategic interaction. In: First International Conference on Agents and Artificial Intelligence, INSTICC, pp. 587–590 (2009)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Rustam Tagiew
    • 1
  1. 1.Institute for Computer Science of TU Bergakademie FreibergGermany

Personalised recommendations