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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Russel, S., Norvig, P.: Artificial Intelligence. Pearson Education, London (2003)
Osborne, M.J., Rubinstein, A.: A course in game theory. MIT Press, Cambridge (1994)
Nash, J.: Non-cooperative games. Annals of Mathematics (54), 286–295 (1951)
Grosz, B., Pfeffer, A.: Colored trails, http://www.eecs.harvard.edu/ai/ct/
Phelps, S.G.: Evolutionary Mechanism Design. PhD thesis, University of Liverpool (2007)
Tagiew, R.: Multi-agent petri-games. In: Mohammadian, M. (ed.) CIMCA 2008 – IAWTIC 2008 – ISE 2008. IEEE Computer Society Press, Los Alamitos (2009)
Kearns, M., Littman, M., Singh, S.: Graphical models for game theory. In: Proceedings of UAI (2001)
Leyton, K., Tennenholtz, M.: Local-effect games. In: IJCAI (2003)
Rosenthal, R.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory 2, 65–67 (1973)
Bhat, N., Leyton-Brown, K.: Computing nash equilibria of action-graph games. In: Proceedings of UAI (2004)
Clempner, J.: Modeling shortest path games with petri nets: a lyapunov based theory. Appl. Math. Comput. Sci. 16(3), 387–397 (2006)
Kanovich, I.M.: Petri nets, horn programs, linear logic and vector games. Annals of Pure and Applied Logic 75 (1995)
Westergaard, M.: Game coloured petri nets. In: Seventh Workshop on Practical Use of Coloured Petri Nets and the CPN Tools (2006)
Koller, D., Pfeffer, A.: Representations and solutions for game-theoretic problems. Artificial Intelligence 94(1-2), 167–215 (1997)
Turocy, T.L.: Toward a black-box solver for finite games. In: IMA Software for Algebraic Geometry Workshop. Springer, Heidelberg (2008)
Genesereth, M.R., Love, N., Pell, B.: General game playing: Overview of the aaai competition. AI Magazine 26(2), 62–72 (2005)
Priese, L., Wimmel, H.: Petri-Netze. Springer, Heidelberg (2008)
Tagiew, R.: Towards a framework for management of strategic interaction. In: First International Conference on Agents and Artificial Intelligence, INSTICC, pp. 587–590 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Tagiew, R. (2009). On Multi-agent Petri Net Models for Computing Extensive Finite Games. In: Nguyen, N.T., Katarzyniak, R.P., Janiak, A. (eds) New Challenges in Computational Collective Intelligence. Studies in Computational Intelligence, vol 244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03958-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-03958-4_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03957-7
Online ISBN: 978-3-642-03958-4
eBook Packages: EngineeringEngineering (R0)