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… 

Figures from this paper

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

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.

General Game Management Agent

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.

Partial Order Reduction for Reachability Games

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.

Stubborn Set Reduction for Two-Player Reachability Games

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.

If more than Analytical Modeling is Needed to Predict Real Agents' Strategic Interaction

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.

Beyond Analytical Modeling , Gathering Data to Predict Real Agents ’ Strategic Interaction

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.

Detecting structural deadlocks in Multiplayer Games using automatically generated Petri Nets

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.

What Government by Algorithm Might Look Like

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.

References

SHOWING 1-5 OF 5 REFERENCES

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

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