Infinite Horizon Markov Economies
Overview
Overall Novelty Assessment
The paper introduces Markov pseudo-games, a framework generalizing both Markov games and pseudo-games to capture time, uncertainty, and action-dependent feasibility sets. It proves equilibrium existence and provides a polynomial-time solution method. Within the taxonomy, the work resides in 'Markov Exchange Economy Computation,' a leaf containing only three papers. This is a relatively sparse research direction within the broader field of fifty papers, suggesting the specific combination of Markovian structure, pseudo-game formulation, and computational tractability remains underexplored.
The taxonomy reveals that neighboring leaves address related but distinct challenges. 'OLG and Finite Horizon Computation' focuses on overlapping generations and finite-dimensional settings, while 'Stationary Markov Equilibrium Computation' emphasizes game-theoretic methods without the exchange economy context. The 'Existence and Characterization of Equilibria' branch provides theoretical foundations for incomplete markets and debt constraints, but excludes computational methods. The paper bridges these areas by combining game-theoretic equilibrium computation with infinite-horizon exchange economy models, positioning itself at the intersection of strategic interaction and economic equilibrium.
Among twenty-one candidates examined, none clearly refute the three main contributions. The Markov pseudo-games framework examined ten candidates with zero refutations, the reformulation of recursive Radner equilibria examined six with zero refutations, and the generative adversarial policy network examined five with zero refutations. This limited search scope—top-K semantic matches plus citation expansion—suggests that within the examined literature, the specific combination of pseudo-game formulation, polynomial-time convergence guarantees, and application to infinite-horizon Markov exchange economies appears novel. However, the small candidate pool means broader prior work may exist outside this search.
Given the sparse taxonomy leaf and absence of refutations among examined candidates, the work appears to occupy a relatively unexplored niche. The analysis covers a focused subset of the literature rather than an exhaustive survey, so definitive claims about absolute novelty remain premature. The contribution's distinctiveness likely stems from integrating game-theoretic pseudo-games with economic equilibrium computation, a combination not prominently represented in the examined papers.
Taxonomy
Research Landscape Overview
Claimed Contributions
The authors introduce Markov pseudo-games (MPGs), a game-theoretic framework that combines dynamic uncertainty from Markov games with action-dependent feasibility from pseudo-games. They establish existence of generalized Markov perfect equilibria in concave MPGs and provide a polynomial-time algorithm for computing approximate stationary points of exploitability under mild assumptions.
The authors prove that the set of recursive Radner equilibria in infinite-horizon Markov exchange economies equals the set of generalized Markov perfect equilibria in an associated Markov pseudo-game. This reformulation establishes existence of recursive Radner equilibria and enables their computational approximation through the MPG framework.
The authors implement their solution method as a generative adversarial policy network (GAPNet) using neural network parameterizations. They demonstrate its practical effectiveness by computing equilibria in various infinite-horizon economies with different utility functions and transition structures.
Contribution Analysis
Detailed comparisons for each claimed contribution
Markov pseudo-games framework with equilibrium existence and polynomial-time solution method
The authors introduce Markov pseudo-games (MPGs), a game-theoretic framework that combines dynamic uncertainty from Markov games with action-dependent feasibility from pseudo-games. They establish existence of generalized Markov perfect equilibria in concave MPGs and provide a polynomial-time algorithm for computing approximate stationary points of exploitability under mild assumptions.
[57] On characterization and existence of constrained correlated equilibria in Markov games PDF
[58] Generalized Bayesian Nash Equilibrium with Continuous Type and Action Spaces PDF
[59] Tractable multi-agent reinforcement learning through behavioral economics PDF
[60] Moment-based Markov equilibrium estimation of high-dimension dynamic games: An application to groundwater management in California PDF
[61] Mean-Field Games with Constraints PDF
[62] Stochastic Aggregative Games with Coupled Inequality Constraints PDF
[63] An online Q-learning design for stochastic differential LQ game with completely unknown dynamics PDF
[64] The Lagrangian Method for Solving Constrained Markov Games PDF
[65] Energy-aware competitive power allocation for heterogeneous networks under QoS constraints PDF
[66] Finding the Equilibrium for Continuous Constrained Markov Games Under the Average Criteria PDF
Reformulation of recursive Radner equilibria as Markov pseudo-game equilibria
The authors prove that the set of recursive Radner equilibria in infinite-horizon Markov exchange economies equals the set of generalized Markov perfect equilibria in an associated Markov pseudo-game. This reformulation establishes existence of recursive Radner equilibria and enables their computational approximation through the MPG framework.
[51] Sunspot equilibria in sequential markets models PDF
[52] Recursive General Equilibrium in Multi-Sector Economies: an Explicit Solution PDF
[53] Incomplete financial markets with an infinite horizon PDF
[54] Existence of a Radner equilibrium in a model with transaction costs PDF
[55] Radner Equilibrium in Infinite and Finite Time-Horizon Levy Models PDF
[56] Recursive competitive equilibrium in dynamic stochastic economies with endogenous risk PDF
Generative adversarial policy network for computing equilibria in infinite-horizon economies
The authors implement their solution method as a generative adversarial policy network (GAPNet) using neural network parameterizations. They demonstrate its practical effectiveness by computing equilibria in various infinite-horizon economies with different utility functions and transition structures.