DocumentCode
2662807
Title
Multi-Agent Petri-Games
Author
Tagiew, Rustam
Author_Institution
Inst. for Comput. Sci., Tech. Univ. Bergakad. Freiberg, Freiberg, Germany
fYear
2008
fDate
10-12 Dec. 2008
Firstpage
130
Lastpage
135
Abstract
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.
Keywords
Petri nets; game theory; high level languages; multi-agent systems; Petri nets; discrete time periods; game computing; language; multi-agent Petri-games; representable games; strategic interactions; Algorithm design and analysis; Autonomous agents; Computer science; Concrete; Game theory; Humans; Pattern matching; Petri nets; Tree graphs; Domain Specific Language; Game Theory; Petri Nets;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence for Modelling Control & Automation, 2008 International Conference on
Conference_Location
Vienna
Print_ISBN
978-0-7695-3514-2
Type
conf
DOI
10.1109/CIMCA.2008.15
Filename
5172612
Link To Document