On Nash-solvability in pure stationary strategies of the deterministic n-person games with perfect information and mean or total effective cost
From MaRDI portal
Publication:2440107
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
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?)
- scientific article; zbMATH DE number 21293 (Why is no real title available?)
- scientific article; zbMATH DE number 3542195 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1559516 (Why is no real title available?)
- scientific article; zbMATH DE number 3333895 (Why is no real title available?)
- A characterization of the minimum cycle mean in a digraph
- 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
- A theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of (2×k)-bimatrix games
- Bottleneck extrema
- Chess-like games may have no uniform Nash equilibria even in mixed strategies
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Cyclical games with prohibitions
- Deterministic graphical games
- Deterministic graphical games revisited
- Equilibrium points in n -person games
- Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction
- Extensions of two person zero sum games
- Maximizing the minimum source-sink path subject to a budget constraint
- Maximum-Minimum Sätze über Graphen
- Nash-solvable two-person symmetric cycle game forms
- Non-cooperative games
- 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 acyclicity of games with cycles
- On canonical forms for zero-sum stochastic mean payoff games
- On effectivity functions of game forms
- On short paths interdiction problems: Total and node-wise limited interdiction
- On the hardness of approximating minimum vertex cover
- Positional strategies for mean payoff games
- Pure subgame-perfect equilibria in free transition games
- Shortest-path network interdiction
- Stochastic Games
- Stochastic Games with Perfect Information and Time Average Payoff
- Stochastic Shortest Path Games
- Subgame perfection in positive recursive games with perfect information
- 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
Cited in
(7)- Nash-solvable two-person symmetric cycle game forms
- 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
- Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
- 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
- Making the best of limited memory in multi-player discounted sum games
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)
