Nash Equilibria Conditions for Cyclic Games with p Players

DOI10.1016/J.ENDM.2006.06.081zbMATH Open1134.91344OpenAlexW2006643216MaRDI QIDQ3439488FDOQ3439488

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

Nash equilibriaparity gamescyclic gamesergodic cyclic games

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

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)