Cycles in extensive form perfect information games

DOI10.1016/0022-247X(91)90217-NzbMath0745.90098OpenAlexW1977140951MaRDI QIDQ1176957

Steven Alpern

Publication date: 25 June 1992

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-247x(91)90217-n

zbMATH Keywords

directed graphperfect information gamesexistence of Nash equilibriaduopoly pricingsurveillance games

Mathematics Subject Classification ID

Games involving graphs (91A43) Microeconomic theory (price theory and economic markets) (91B24)

Related Items

The complexity of mean payoff games on graphs, On the Existence of Stationary Nash Equilibria for Mean Payoff Games on Graphs, On the convergence properties of measurable multifunctions with values in a separable Banach space, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata play the repeated prisoner's dilemma
• Discrete hamstrung squad car games
• Positional strategies for mean payoff games
• A computation method for matrix differential games
• Deterministic graphical games
• Game with Repeated Decisions
• A Theory of Dynamic Oligopoly, II: Price Competition, Kinked Demand Curves, and Edgeworth Cycles
• Pursuit—Evasion games on graphs
• On Stochastic Games with Stationary Optimal Strategies
• Stochastic Games with Perfect Information and Time Average Payoff