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.025zbMATH Open1286.91026OpenAlexW2039792186MaRDI QIDQ2440107FDOQ2440107

Authors: Vladimir Oudalov, Vladimir 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

Recommendations

On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
scientific article; zbMATH DE number 7559416
On Nash equilibrium solutions in nonzero-sum stochastic games with complete information
On the existence of almost-pure-strategy Nash equilibrium in \(n\)-person finite games
scientific article; zbMATH DE number 4064793
Publication:4504050
scientific article; zbMATH DE number 1329116
On pure Nash equilibria in stochastic games
Pure stationary Nash equilibria for discounted stochastic positional games
Pure and mixed stationary Nash equilibria for average stochastic positional games

Nash equilibrium stochastic games chess-like games local cost mean and total effective cost pure and stationary strategies

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations
Nash-solvable two-person symmetric cycle game forms
Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
A three-person deterministic graphical game without Nash equilibria
Title not available (Why is that?)

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

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