From Nash Equilibria to Chain Recurrent Sets: An Algorithmic Solution Concept for Game Theory

Area of Science:

• Game Theory
• Dynamical Systems
• Topology

Background:

• Nash equilibrium, a foundational concept in game theory, relies on fixed-point theorems.
• Existing solutions like Nash equilibrium may not fully capture complex game dynamics.

Purpose of the Study:

• Introduce a new class of universal non-equilibrium solution concepts for games.
• Utilize theorems from the topology of dynamical systems to analyze game behavior.
• Propose chain recurrent sets as a generalized solution concept.

Main Methods:

• Define games with associated learning dynamics over mixed strategies.
• Apply concepts from dynamical systems theory, specifically chain recurrent sets.
• Analyze benchmark games under replicator dynamics.

Main Results:

• Chain recurrent sets offer a more general solution concept than Nash equilibria.
• For potential games, this concept aligns with existing equilibria.
• In zero-sum games, chain recurrent sets can encompass the entire state space.

Conclusions:

• Chain recurrent sets provide an algorithmic and constructive approach to game solutions.
• This framework reveals new computational and structural questions in game theory.
• The concept offers a novel perspective on game outcomes and dynamics.