Nash Equilibria Conditions for Cyclic Games with p Players

DOI10.1016/J.ENDM.2006.06.081MaRDI QIDQ3439488zbMATH OpenOpenAlexFDO

Authors Stefan Pickl, Dmitrii Lozovanu

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2006.06.081

zbMATH Keywords

cyclic gamesergodic cyclic gamesNash equilibriaparity games

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Cites work

• A Special Dynamic Programming Technique for Multiobjective Discrete Control and for Dynamic Games on Graph-Based Networks
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
• scientific article; zbMATH DE number 59245 (Why is no real title available?)
• Integer Programming and Combinatorial Optimization
• Optimal paths in network games with \(p\) players
• Positional strategies for mean payoff games
• The complexity of mean payoff games on graphs

Cited in

(2)

• The Effective Computation of Equilibrium Point for N-Person Games Cyclic to the Next Person
• On Nash equilibria in stochastic positional games with average payoffs

This page was built for publication: Nash Equilibria Conditions for Cyclic Games with p Players

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