On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost

DOI10.1016/j.dam.2013.10.025zbMath1286.91026OpenAlexW2039792186MaRDI QIDQ2440107

Vladimir Oudalov, Vladimir A. Gurvich

Publication date: 27 March 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.025

zbMATH Keywords

Nash equilibriumstochastic gameschess-like gameslocal costmean and total effective costpure and stationary strategies

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15) Positional games (pursuit and evasion, etc.) (91A24)

Related Items (2)

Unnamed Item ⋮ A three-person deterministic graphical game without Nash equilibria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On canonical forms for zero-sum stochastic mean payoff games
• On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
• Chess-like games may have no uniform Nash equilibria even in mixed strategies
• Polynomial-time algorithms for energy games with special weight structures
• Nash-solvable two-person symmetric cycle game forms
• Cyclical games with prohibitions
• On acyclicity of games with cycles
• On the hardness of approximating minimum vertex cover
• On short paths interdiction problems: Total and node-wise limited interdiction
• Pure subgame-perfect equilibria in free transition games
• The bad match; a total reward stochastic game
• Positional strategies for mean payoff games
• Extensions of two person zero sum games
• A characterization of the minimum cycle mean in a digraph
• Total reward stochastic games and sensitive average reward strategies
• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• On effectivity functions of game forms
• Deterministic graphical games
• Non-cooperative games
• Subgame Perfection in Positive Recursive Games with Perfect Information
• Maximum-Minimum Sätze über Graphen
• A theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of (2×k)-bimatrix games
• Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
• A Pumping Algorithm for Ergodic Stochastic Mean Payoff Games with Perfect Information
• A stochastic game with complete information and without equilibrium situations in pure stationary strategies
• The solvability of positional games in pure strategies
• Maximizing the minimum source-sink path subject to a budget constraint
• Stochastic Shortest Path Games
• Shortest-path network interdiction
• Stochastic Games with Perfect Information and Time Average Payoff
• Bottleneck extrema
• Equilibrium points in n -person games
• Stochastic Games
• Deterministic Graphical Games Revisited

This page was built for publication: On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost