Multi-Agent Petri-Games

@article{Tagiew2008MultiAgentP,
  title={Multi-Agent Petri-Games},
  author={Rustam Tagiew},
  journal={2008 International Conference on Computational Intelligence for Modelling Control \& Automation},
  year={2008},
  pages={130-135}
}
  • Rustam Tagiew
  • Published 10 December 2008
  • Computer Science
  • 2008 International Conference on Computational Intelligence for Modelling Control & Automation
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… Expand
View on IEEE
doi.ieeecomputersociety.org
8 Citations
Background Citations
4

8 Citations

Citation Type

Citation Type

On Multi-agent Petri Net Models for Computing Extensive Finite Games
TLDR
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 compared to default game representation in extensive form. Expand
General Game Management Agent
TLDR
The task of managing general game playing in a multi-agent system is the problem addressed in this paper and the language presented is more expressive than the language GDL, which is already used for such purposes. Expand
Partial Order Reduction for Reachability Games
TLDR
This work presents a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability/safety objectives and formally proves its correctness on the class of games played on general labelled transition systems. Expand
Stubborn Set Reduction for Two-Player Reachability Games
TLDR
This work presents a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability objectives, and formally proves its correctness on the class of games played on general labelled transition systems. Expand
If more than Analytical Modeling is Needed to Predict Real Agents' Strategic Interaction
TLDR
A concept of interdisciplinary game description language as a part of the focused interdisciplinary research infrastructure for understanding human reasoning in game-theoretic terms is presented. Expand
Beyond Analytical Modeling , Gathering Data to Predict Real Agents ’ Strategic Interaction
This paper presents research proposals on the interdisciplinary research infrastructure for understanding human reasoning in game-theoretic terms. Strategic reasoning impacts human decision making in… Expand
Detecting structural deadlocks in Multiplayer Games using automatically generated Petri Nets
TLDR
This paper describes the approach for detecting structural errors in scene-based single and multiplayer games by generating a Petri Net where the individual game elements are mapped to appropriate constructs and can be used in an external tool to verify that the game has certain properties. Expand
What Government by Algorithm Might Look Like
TLDR
This paper summarises technologies useful to create algocratic social machines and presents idealistic examples of their application, including smart contracts and their implementations, challenges of behaviour mining and prediction, as well as game-theoretic and AI approaches to mechanism design. Expand

References

SHOWING 1-5 OF 5 REFERENCES
Representations and Solutions for Game-Theoretic Problems
TLDR
The Gala system is described, an implemented system that allows the specification and efficient solution of large imperfect information games and provides a new declarative language for compactly and naturally representing games by their rules. Expand
A Course in Game Theory
A Course in Game Theory presents the main ideas of game theory at a level suitable for graduate students and advanced undergraduates, emphasizing the theory's foundations and interpretations of its… Expand
Yaml ain’t markup language (YAMLTM)
  • yaml.org/spec/
  • 2004
Petri-Netze
  • Petri-Netze
  • 2008
Yaml ain't markup language (YAML TM ). yaml.org/spec
  • Yaml ain't markup language (YAML TM ). yaml.org/spec
  • 2004