On Nash-solvability of n-person graphical games under Markov and a-priori realizations

Recommendations

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
On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
On the Existence of Stationary Nash Equilibria for Mean Payoff Games on Graphs
Computer Science Logic

Cites work

scientific article; zbMATH DE number 3128733 (Why is no real title available?)
scientific article; zbMATH DE number 3148886 (Why is no real title available?)
scientific article; zbMATH DE number 4095249 (Why is no real title available?)
scientific article; zbMATH DE number 3542195 (Why is no real title available?)
scientific article; zbMATH DE number 3333895 (Why is no real title available?)
scientific article; zbMATH DE number 3078991 (Why is no real title available?)
A Theory of N -Person Games with Perfect Information
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 theorem on the existence of equilibrium situations in pure stationary strategies for ergodic extensions of (2×k)-bimatrix games
A three-person deterministic graphical game without Nash equilibria
Backward induction in presence of cycles
Bottleneck extrema
Chess-like games may have no uniform Nash equilibria even in mixed strategies
Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
Cyclic games and an algorithm to find minimax cycle means in directed graphs
Deciding parity games in quasipolynomial time
Deterministic graphical games
Discrete Dynamic Programming
Equilibrium points in n -person games
Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
Mathematical Foundations of Computer Science 2004
Monotone bargaining is Nash-solvable
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 Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost
On acyclicity of games with cycles
Perfect information stochastic games and related classes
Positional strategies for mean payoff games
Pure subgame-perfect equilibria in free transition games
Semi-Markov strategies in stochastic games
Stochastic Games
Stochastic Games with Perfect Information and Time Average Payoff
The Existence of Equilibrium in Discontinuous Economic Games, I: Theory
The bad match; a total reward stochastic game
The solvability of positional games in pure strategies

This page was built for publication: On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations

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