Stochastic Potential Games

05/27/2020
by   David Mguni, et al.
0

Computing the Nash equilibrium (NE) for N-player non-zerosum stochastic games is a formidable challenge. Currently, algorithmic methods in stochastic game theory are unable to compute NE for stochastic games (SGs) for settings in all but extreme cases in which the players either play as a team or have diametrically opposed objectives in a two-player setting. This greatly impedes the application of the SG framework to numerous problems within economics and practical systems of interest. In this paper, we provide a method of computing Nash equilibria in nonzero-sum settings and for populations of players more than two. In particular, we identify a subset of SGs known as stochastic potential games (SPGs) for which the (Markov perfect) Nash equilibrium can be computed tractably and in polynomial time. Unlike SGs for which, in general, computing the NE is PSPACE-hard, we show that SGs with the potential property are P-Complete. We further demonstrate that for each SPG there is a dual Markov decision process whose solution coincides with the MP-NE of the SPG. We lastly provide algorithms that tractably compute the MP-NE for SGs with more than two players.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/28/2022

Learning Stationary Nash Equilibrium Policies in n-Player Stochastic Games with Independent Chains via Dual Mirror Descent

We consider a subclass of n-player stochastic games, in which players ha...
research
03/19/2022

Incentive Compatibility in Two-Stage Repeated Stochastic Games

We address the problem of mechanism design for two-stage repeated stocha...
research
08/30/2023

Hidden-Role Games: Equilibrium Concepts and Computation

In this paper, we study the class of games known as hidden-role games in...
research
10/18/2021

Empirical Policy Optimization for n-Player Markov Games

In single-agent Markov decision processes, an agent can optimize its pol...
research
04/08/2022

The Complexity of Infinite-Horizon General-Sum Stochastic Games

We study the complexity of computing stationary Nash equilibrium (NE) in...
research
01/16/2013

Fast Planning in Stochastic Games

Stochastic games generalize Markov decision processes (MDPs) to a multia...
research
10/18/2022

Exploitability Minimization in Games and Beyond

Pseudo-games are a natural and well-known generalization of normal-form ...

Please sign up or login with your details

Forgot password? Click here to reset