Tight cyclic game forms

DOI10.1070/RM1991V046N02ABEH002787MaRDI QIDQ3980227zbMATH OpenOpenAlexFDO

Authors A. I. Gol'Berg, Vladimir Gurvich

Publication date 26 June 1992

Published in Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/rm1991v046n02abeh002787

zbMATH Keywords

densityNash equilibriumcyclic gamesstochastic games with complete information

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15)

Recommendations

• scientific article; zbMATH DE number 219978
• scientific article; zbMATH DE number 497479
• A note of tight extensive game forms
• Acyclic, or totally tight, two-person game forms: characterization and main properties
• Cycles in extensive form perfect information games
• Cyclic games and linear programming
• On Acyclicity of Games with Cycles
• On acyclicity of games with cycles
• A criterion and verification of the ergodicity of cyclic game forms
• Effectively solvable classes of cyclical games

Cited in

(10)

• scientific article; zbMATH DE number 497479 (Why is no real title available?)
• scientific article; zbMATH DE number 219978 (Why is no real title available?)
• 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
• Monotone bargaining is Nash-solvable
• On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles.
• scientific article; zbMATH DE number 4099084 (Why is no real title available?)
• Cyclical games with prohibitions
• Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
• Strongly consistent game forms

This page was built for publication: Tight cyclic game forms

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