Equilibrium paths in discounted supergames

DOI10.1016/j.dam.2019.01.026zbMath1411.91071OpenAlexW2149365931WikidataQ128373116 ScholiaQ128373116MaRDI QIDQ1741494

Mitri Kitti, Kimmo Berg

Publication date: 3 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.mitrikitti.fi/dp96.pdf

zbMATH Keywords

complexityequilibrium pathrepeated gamesubgame-perfect equilibriumgraph presentation of paths

Mathematics Subject Classification ID

Games involving graphs (91A43) Games in extensive form (91A18) Multistage and repeated games (91A20)

Related Items

Elementary subpaths in discounted stochastic games ⋮ Conditional Markov equilibria in discounted dynamic games ⋮ A complete characterization of infinitely repeated two-player games having computable strategies with no computable best response under limit-of-means payoff ⋮ On the limit perfect public equilibrium payoff set in repeated and stochastic games ⋮ Set-valued games and mixed-strategy equilibria in discounted supergames

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Elementary subpaths in discounted stochastic games
• Conditionally stationary equilibria in discounted dynamic games
• Subgame perfect equilibria in discounted stochastic games
• The myth of the folk theorem
• Extremal equlibria of oligopolistic supergames
• Optimal cartel equilibria with imperfect monitoring
• The graph of Prisoners' Dilemma supergame payoffs as a function of the discount factor
• Strongly symmetric subgame perfect equilibria in infinitely repeated games with perfect monitoring and discounting
• Algorithms for finding repeated game equilibria
• Construction of subgame-perfect mixed-strategy equilibria in repeated games
• Set-valued games and mixed-strategy equilibria in discounted supergames
• The maximum efficient equilibrium payoff in the repeated prisoners' dilemma.
• Non-computable strategies and discounted repeated games
• Valuating payoff streams under unequal discount factors
• Conditional Markov equilibria in discounted dynamic games
• On the Complexity of Approximating a Nash Equilibrium
• Settling the complexity of computing two-player Nash equilibria
• Hausdorff Dimension in Graph Directed Constructions
• On the Theory of Infinitely Repeated Games with Discounting
• On Repeated Games with Complete Information
• Toward a Theory of Discounted Repeated Games with Imperfect Monitoring
• A fractal dimension estimate for a graph-directed IFS of non-similarities
• An algorithm for two-player repeated games with perfect monitoring
• The Folk Theorem in Repeated Games with Discounting or with Incomplete Information
• FRACTAL GEOMETRY OF EQUILIBRIUM PAYOFFS IN DISCOUNTED SUPERGAMES
• The Complexity of Computing a Nash Equilibrium
• Computing Supergame Equilibria

This page was built for publication: Equilibrium paths in discounted supergames