# A process algebraic form to represent extensive games

## TL;DR

This paper presents a novel agent-based process algebra framework for representing extensive games, along with an efficient algorithm to compute Nash equilibria in linear space.

## Contribution

It introduces a new process algebraic representation for multi-party games and an algorithm to find Nash equilibria efficiently.

## Key findings

- Compact process algebraic representation of extensive games
- Linear space complexity algorithm for Nash equilibrium computation
- Enhanced understanding of game structure through process theory

## 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.