Computational Intelligence for Modelling, Control and Automation, International Conference on (2008)
Dec. 10, 2008 to Dec. 12, 2008
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIMCA.2008.15
We introduce a language for the representation of a subset of strategic interactions. The representation is based on petri nets. Representable games are restricted to have a finite number of states and actions. The language is additionally able to define time critical processes with discrete time periods. It can be used for both tasks of practical game computing: definition of game servers and calculating game theoretical or heuristic solutions. Theoretical analyzes, syntactical details, algorithms and concrete examples are given.
Petri Nets, Game Theory, Domain Specific Language
R. Tagiew, "Multi-Agent Petri-Games," 2008 International Conference on Computational Intelligence for Modelling Control & Automation (CIMCA 2008)(CIMCA), Vienna, 2008, pp. 130-135.