Tight cyclic game forms

DOI10.1070/RM1991v046n02ABEH002787zbMath0737.90084OpenAlexW2010169529MaRDI QIDQ3980227

A. I. Gol'Berg, Vladimir A. 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

Nash equilibriumdensitycyclic gamesstochastic games with complete information

Mathematics Subject Classification ID

Stochastic games, stochastic differential games (91A15)

Related Items (5)

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 ⋮ On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. ⋮ Nash-solvable two-person symmetric cycle game forms ⋮ Monotone bargaining is Nash-solvable

This page was built for publication: Tight cyclic game forms