Nash-solvable two-person symmetric cycle game forms

DOI10.1016/J.DAM.2011.05.011MaRDI QIDQ642972zbMATH OpenOpenAlexDBLPWikidataFDO

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

zbMATH Keywords

games on graphspositional gamespure strategies2-person gamesNash solvability

Mathematics Subject Classification ID

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)

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

Cites work

• 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 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 497479 (Why is no real title available?)
• scientific article; zbMATH DE number 219978 (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 criterion and verification of the ergodicity of cyclic game forms
• 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
• Cyclic games and an algorithm to find minimax cycle means in directed graphs
• Cyclic games and linear programming
• Cyclical games with prohibitions
• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
• Deterministic Graphical Games Revisited
• Deterministic multi-player Dynkin games.
• Dual cores and effectivity functions
• Equilibrium points in n -person games
• Extensions of two person zero sum games
• Extensive Games
• 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 effectivity functions of game forms
• On the Complexity of Dualization of Monotone Disjunctive Normal Forms
• Paths, Trees, and Flowers
• Positional strategies for mean payoff games
• Pure subgame-perfect equilibria in free transition games
• The solvability of positional games in pure strategies
• Tight cyclic game forms
• Undirected edge geography

Cited in

(16)

• Nash-solvable two-person symmetric cycle game forms
• Lexicographically maximal edges of dual hypergraphs and Nash-solvability of tight game forms
• Monotone bargaining is Nash-solvable
• 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
• Two-person pairwise solvable games
• Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
• Acyclic, or totally tight, two-person game forms: characterization and main properties
• Deterministic \(n\)-person shortest path and terminal games on symmetric digraphs have Nash equilibria in pure stationary strategies
• 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 acyclicity of games with cycles
• On Nash-solvability of \(n\)-person graphical games under Markov and a-priori realizations
• 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
• Chess-like games may have no uniform Nash equilibria even in mixed strategies

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)