Deterministic n-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies

DOI10.1007/S00182-023-00875-YMaRDI QIDQ6581883zbMATH OpenFDO

Authors Endre Boros, Paolo G. Franciosa, Vladimir Gurvich, Mikhail Vyalyi

Publication date 1 August 2024

Published in International Journal of Game Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

Nash equilibriumshortest path games\(n\)-person deterministic graphical gamesterminal games

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Recommendations

• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
• Nash-solvable two-person symmetric cycle game forms
• A three-person deterministic graphical game without Nash equilibria
• Nash equilibria in mixed stationary strategies for \(m\)-player mean payoff games on networks

Cites work

• scientific article; zbMATH DE number 3128733 (Why is no real title available?)
• scientific article; zbMATH DE number 4095249 (Why is no real title available?)
• A nested family of \(k\)-total effective rewards for positional games
• A stochastic game with complete information and without equilibrium situations in pure stationary strategies
• A three-person deterministic graphical game without Nash equilibria
• Backward induction in presence of cycles
• Contributions to the Theory of Games (AM-39), Volume III
• Deterministic graphical games
• GO Is Polynomial-Space Hard
• Maximum-Minimum Sätze über Graphen
• Monotone bargaining is Nash-solvable
• Nash-solvable two-person symmetric cycle game forms
• On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
• On the complexity of some two-person perfect-information games
• The bad match; a total reward stochastic game
• The solvability of positional games in pure strategies
• Total reward stochastic games and sensitive average reward strategies
• Undirected edge geography

This page was built for publication: Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies

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