Nash equilibria in mixed stationary strategies for m-player mean payoff games on networks

zbMATH Open1419.91019MaRDI QIDQ4556161FDOQ4556161

Authors: Stefan Pickl, Dmitrii Lozovanu 

Publication date: 23 November 2018

Recommendations

• Pure and mixed stationary Nash equilibria for average stochastic positional games
• Computer Science Logic
• On Nash equilibria for stochastic games and determining the optimal strategies of the players
• scientific article; zbMATH DE number 6681222
• Mixed Nash equilibria in concurrent terminal-reward games

zbMATH Keywords

Nash equilibriamean payoff gamepure stationary strategymixed stationary strategy

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Games involving graphs (91A43)

Cited In (9)

• On the Existence of Stationary Nash Equilibria for Mean Payoff Games on Graphs
• Nash equilibria and values through modular partitions in infinite games
• Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
• On a Network Generalization of the Minmax Theorem
• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• The existence theorem of absolute equilibrium about games on connected graph with state payoff vector
• Equilibria in pure strategies for a two-player zero-sum average stochastic positional game
• A note on generalized Nash games played on networks
• Separable Network Games with Compact Strategy Sets

This page was built for publication: Nash equilibria in mixed stationary strategies for \(m\)-player mean payoff games on networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556161)