scholarly journals Bounding fixed points of set-based Bellman operator and Nash equilibria of stochastic games

Automatica ◽  
2021 ◽  
Vol 130 ◽  
pp. 109685
Author(s):  
Sarah H.Q. Li ◽  
Assalé Adjé ◽  
Pierre-Loïc Garoche ◽  
Behçet Açıkmeşe
Author(s):  
Krishnendu Chatterjee ◽  
Rupak Majumdar ◽  
Marcin Jurdziński

1999 ◽  
Vol 01 (02) ◽  
pp. 149-158 ◽  
Author(s):  
VICTOR DOMANSKY

Controlled by several agents, multistage processes of resource allocation between production and consumption with random production functions are considered as non-cooperative dynamic stochastic games. For these games, the Nash Equilibria are constructed satisfying the criteria of maximisation of some kind of "public utility". Both finite and infinite horizons of planning are examined.


2020 ◽  
Vol 13 ◽  
pp. 304-323
Author(s):  
Dmitrii Lozovanu ◽  
◽  
Stefan Pickl ◽  

We consider infinite n-person stochastic games with limiting average payoffs criteria for the players. The main results of the paper are concerned with the existence of stationary Nash equilibria and determining the optimal strategies of the players in the games with finite state and action spaces. We present conditions for the existence of stationary Nash equilibria in the considered games and propose an approach for determining the optimal stationary strategies of the players if such strategies exist.


Author(s):  
Matteo Basei ◽  
Haoyang Cao ◽  
Xin Guo

We consider a general class of nonzero-sum N-player stochastic games with impulse controls, where players control the underlying dynamics with discrete interventions. We adopt a verification approach and provide sufficient conditions for the Nash equilibria (NEs) of the game. We then consider the limiting situation when N goes to infinity, that is, a suitable mean-field game (MFG) with impulse controls. We show that under appropriate technical conditions, there exists a unique NE solution to the MFG, which is an ϵ-NE approximation to the N-player game, with [Formula: see text]. As an example, we analyze in detail a class of two-player stochastic games which extends the classical cash management problem to the game setting. In particular, we present numerical analysis for the cases of the single player, the two-player game, and the MFG, showing the impact of competition on the player’s optimal strategy, with sensitivity analysis of the model parameters.


Author(s):  
Yue Guan ◽  
Qifan Zhang ◽  
Panagiotis Tsiotras

We explore the use of policy approximations to reduce the computational cost of learning Nash equilibria in zero-sum stochastic games. We propose a new Q-learning type algorithm that uses a sequence of entropy-regularized soft policies to approximate the Nash policy during the Q-function updates. We prove that under certain conditions, by updating the entropy regularization, the algorithm converges to a Nash equilibrium. We also demonstrate the proposed algorithm's ability to transfer previous training experiences, enabling the agents to adapt quickly to new environments. We provide a dynamic hyper-parameter scheduling scheme to further expedite convergence. Empirical results applied to a number of stochastic games verify that the proposed algorithm converges to the Nash equilibrium, while exhibiting a major speed-up over existing algorithms.


Automatica ◽  
2012 ◽  
Vol 48 (11) ◽  
pp. 2923-2930 ◽  
Author(s):  
H.L. Prasad ◽  
S. Bhatnagar

Sign in / Sign up

Export Citation Format

Share Document