  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.
