Equilibria in multi-player multi-outcome infinite sequential games

DOI10.1016/J.IC.2020.104557MaRDI QIDQ2225601zbMATH OpenOpenAlexFDO

Authors Stéphane Le Roux, Arno Pauly

Publication date 8 February 2021

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1401.3325

zbMATH Keywords

Borel measurabledeterminacyNashPareto optimalperfect informationsecure equilibriumsubgame-perfect

Mathematics Subject Classification ID

Determinacy principles (03E60) (n)-person games, (n>2) (91A06) Multistage and repeated games (91A20)

Abstract: We investigate the existence of certain types of equilibria (Nash, $varepsilon$-Nash, subgame perfect, $varepsilon$-subgame perfect, Pareto-optimal) in multi-player multi-outcome infinite sequential games. We use two fundamental approaches: one requires strong topological restrictions on the games, but produces very strong existence results. The other merely requires some very basic determinacy properties to still obtain some existence results. Both results are transfer results: starting with the existence of some equilibria for a small class of games, they allow us to conclude the existence of some type of equilibria for a larger class. To make the abstract results more concrete, we investigate as a special case infinite sequential games with real-valued payoff functions. Depending on the class of payoff functions (continuous, upper semi-continuous, Borel) and whether the game is zero-sum, we obtain various existence results for equilibria. Our results hold for games with two or up to countably many players.

Recommendations

• Equilibria and approximate equilibria in infinite potential games
• Convex games with an infinite number of players and sequencing situations
• Infinite sequential games with real-valued payoffs
• A characterization of sequential equilibrium strategies in infinitely repeated incomplete information games
• Infinite sequential Nash equilibrium
• The Complexity of Nash Equilibria in Infinite Multiplayer Games
• Equilibria in infinite games of incomplete information
• A semi-potential for finite and infinite sequential games (extended abstract)

Cites work

• A characterization of subgame-perfect equilibrium plays in Borel games of perfect information
• Acyclic Preferences and Existence of Sequential Nash Equilibria: A Formal and Constructive Equivalence
• Algorithmic Game Theory
• An extension of Borel determinacy
• Better Quality in Synthesis through Quantitative Objectives
• Borel determinacy
• Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)
• Correlated equilibria in stochastic games with Borel measurable payoffs
• Deterministic multi-player Dynkin games.
• Dynamics and coalitions in sequential games
• Equilibria in quantitative reachability games
• Equilibrium existence for large perfect information games
• Equilibrium points in n -person games
• Existence of secure equilibrium in multi-player games with perfect information
• Extending finite-memory determinacy to multi-player games
• First steps in constructive game theory
• Games with secure equilibria
• How incomputable is finding Nash equilibria?
• scientific article; zbMATH DE number 3139273 (Why is no real title available?)
• scientific article; zbMATH DE number 4154255 (Why is no real title available?)
• Infinite sequential games with real-valued payoffs
• Infinite sequential Nash equilibrium
• Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy
• Introduction to the inefficiency of equilibria
• On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games
• On Pareto equilibria in vector-valued extensive form games
• On the existence of strong Nash equilibria
• On the existence of weak subgame perfect equilibria
• Perfect information games with upper semicontinuous payoffs
• Perfect-information games with lower-semicontinuous payoffs
• Rational Behaviour and Strategy Construction in Infinite Multiplayer Games
• Repeated Games
• Secure equilibria in weighted games
• Solution concepts and algorithms for infinite multiplayer games
• Subgame-perfect equilibria of finite- and infinite-horizon games
• The Complexity of Nash Equilibria in Limit-Average Games
• The determinacy of Blackwell games
• Weihrauch degrees of finding equilibria in sequential games

Cited in

(11)

• Infinite histories and steady orbits in repeated games
• Extending finite-memory determinacy to multi-player games
• Individual upper semicontinuity and subgame perfect \(\epsilon\)-equilibria in games with almost perfect information
• Infinite Subgame Perfect Equilibrium in the Hausdorff Difference Hierarchy
• Forgiving-Proof Equilibrium in Infinitely Repeated Games
• scientific article; zbMATH DE number 4066674 (Why is no real title available?)
• Infinite sequential games with real-valued payoffs
• Infinite sequential Nash equilibrium
• scientific article; zbMATH DE number 7327943 (Why is no real title available?)
• Games with -automatic preference relations
• Robust equilibrium outcomes in sequential games under almost common certainty of payoffs

This page was built for publication: Equilibria in multi-player multi-outcome infinite sequential games

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