Nash-solvable two-person symmetric cycle game forms

DOI10.1016/j.dam.2011.05.011zbMath1243.05164OpenAlexW2042035286WikidataQ59560534 ScholiaQ59560534MaRDI QIDQ642972

Endre Boros, Wei Shao, Kazuhisa Makino, Vladimir A. 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

zbMATH Keywords

games on graphspositional gamespure strategies2-person gamesNash solvability

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43) Directed graphs (digraphs), tournaments (05C20) Positional games (pursuit and evasion, etc.) (91A24) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (10)

Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles ⋮ On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games ⋮ Nash-solvable two-person symmetric cycle game forms ⋮ 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 ⋮ Acyclic, or totally tight, two-person game forms: characterization and main properties ⋮ On acyclicity of games with cycles ⋮ Monotone bargaining is Nash-solvable ⋮ On Acyclicity of Games with Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games
• Nash-solvable two-person symmetric cycle game forms
• Cyclical games with prohibitions
• Cyclic games and linear programming
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
• Pure subgame-perfect equilibria in free transition games
• Positional strategies for mean payoff games
• Undirected edge geography
• Extensions of two person zero sum games
• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• Deterministic multi-player Dynkin games.
• Dual cores and effectivity functions
• On effectivity functions of game forms
• Non-cooperative games
• 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
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
• A stochastic game with complete information and without equilibrium situations in pure stationary strategies
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Tight cyclic game forms
• The solvability of positional games in pure strategies
• A criterion and verification of the ergodicity of cyclic game forms
• Paths, Trees, and Flowers
• Bottleneck extrema
• Equilibrium points in n -person games
• Extensive Games
• A Theory of N -Person Games with Perfect Information
• Deterministic Graphical Games Revisited

This page was built for publication: Nash-solvable two-person symmetric cycle game forms