A process algebraic form to represent extensive games
Computer Science and Game Theory
2021-10-28 v1
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.
Keywords
Cite
@article{arxiv.1904.12219,
title = {A process algebraic form to represent extensive games},
author = {Omid Gheibi and Rasoul Ramezanian},
journal= {arXiv preprint arXiv:1904.12219},
year = {2021}
}
Comments
20 pages, 6 figures, Control and Cybernetics Journal, 2015