Nash-solvable two-person symmetric cycle game forms
From MaRDI portal
Publication:642972
DOI10.1016/J.DAM.2011.05.011zbMATH Open1243.05164DBLPjournals/dam/BorosGMS11OpenAlexW2042035286WikidataQ59560534 ScholiaQ59560534MaRDI QIDQ642972FDOQ642972
Authors: Endre Boros, Kazuhisa Makino, Wei Shao, Vladimir Gurvich 
Publication date: 27 October 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.05.011
Recommendations
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- 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 the deterministic \(n\)-person games with perfect information and mean or total effective cost
- scientific article; zbMATH DE number 4095249
- Acyclic, or totally tight, two-person game forms: characterization and main properties
Directed graphs (digraphs), tournaments (05C20) 2-person games (91A05) Games on graphs (graph-theoretic aspects) (05C57) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Cites Work
- Non-cooperative games
- Equilibrium points in n -person games
- Title not available (Why is that?)
- Pure subgame-perfect equilibria in free transition games
- Deterministic multi-player Dynkin games.
- Paths, Trees, and Flowers
- Title not available (Why is that?)
- Maximum-Minimum Sätze über Graphen
- On the Complexity of Dualization of Monotone Disjunctive Normal Forms
- Bottleneck extrema
- Positional strategies for mean payoff games
- Cyclic games and an algorithm to find minimax cycle means in directed graphs
- Cyclical games with prohibitions
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
- Extensions of two person zero sum games
- Title not available (Why is that?)
- Undirected edge geography
- On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
- 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
- Tight cyclic game forms
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Extensive Games
- A Theory of N -Person Games with Perfect Information
- Deterministic Graphical Games Revisited
- Nash-solvable two-person symmetric cycle game forms
- Cyclic games and linear programming
- Dual cores and effectivity functions
- On effectivity functions of game forms
- A criterion and verification of the ergodicity of cyclic game forms
Cited In (15)
- Total tightness implies Nash-solvability for three-person game forms
- 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
- On Acyclicity of Games with Cycles
- Nash-solvable two-person symmetric cycle game forms
- On acyclicity of games with cycles
- Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
- Acyclic, or totally tight, two-person game forms: characterization and main properties
- Monotone bargaining is Nash-solvable
- 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
- Chess-like games may have no uniform Nash equilibria even in mixed strategies
- A three-person deterministic graphical game without Nash equilibria
- Two-person pairwise solvable games
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
This page was built for publication: Nash-solvable two-person symmetric cycle game forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642972)
