A process algebraic form to represent extensive games
Abstract
In this paper, we introduce an agent-based representation of games, in order to propose a compact representation for multi-party games in game theory. Our method is inspired by concepts in process theory and process algebra. In addition, we introduce an algorithm whose input is a game in the form of process algebra (proposed in this paper) and as an output, finds the Nash equilibrium of the game in linear space complexity.
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2019
- DOI:
- 10.48550/arXiv.1904.12219
- arXiv:
- arXiv:1904.12219
- Bibcode:
- 2019arXiv190412219G
- Keywords:
-
- Computer Science - Computer Science and Game Theory
- E-Print:
- 20 pages, 6 figures, Control and Cybernetics Journal, 2015