• Corpus ID: 249017956

Repeated Games with Tail-Measurable Payoffs

@inproceedings{Flesch2022RepeatedGW,
  title={Repeated Games with Tail-Measurable Payoffs},
  author={J{\'a}nos Flesch and Eilon Solan},
  year={2022}
}
We study multiplayer Blackwell games, which are repeated games where the payoff of each player is a bounded and Borel-measurable function of the infinite stream of actions played by the players during the game. These games are an extension of the two-player perfect-information games studied by David Gale and Frank Stewart (1953). Recently, various new ideas have been discovered to study Blackwell games. In this paper, we give an overview of these ideas by proving, in four different ways, that… 

References

SHOWING 1-10 OF 34 REFERENCES
Infinite sequential games with real-valued payoffs
TLDR
This work investigates the existence of certain types of equilibria in infinite sequential games with real-valued payoff functions depending on the class of payoff functions and whether the game is zero-sum and forms an abstract equilibrium transfer result about games with compact strategy spaces and open preferences.
Existence of equilibria in repeated games with long-run payoffs
Significance Nash equilibrium, of central importance in strategic game theory, exists in all finite games. Here we prove that it exists also in all infinitely repeated games, with a finite or
On Nash Equilibria in Stochastic Games
TLDR
It is shown that if each player has a reachability objective, that is, if the goal for each player i is to visit some subset of the states, then there exists an e-Nash equilibrium in memoryless strategies, for every e >0, however, exact Nash equilibria need not exist.
On the existence of weak subgame perfect equilibria
TLDR
The recently introduced notion of weak subgame perfect equilibrium weak SPE is focused on, a variant of the classical notion of SPE, where players who deviate can only use strategies deviating from their initial strategy in a finite number of histories.
Two-player Nonzero-sum !-regular Games
We study in nite stochastic games played by two-players on a nite graph with goals speci ed by sets of in nite traces. The games are concurrent (each player simultaneously and independently chooses
Borel Stochastic Games with Lim Sup Payoff
We consider two-person zero-sum stochastic games with limit superior payoff function and Borel measurable state and action spaces. The games are shown to have a value and the value function is
Pure Nash Equilibria in Concurrent Deterministic Games
TLDR
A novel construction is provided, called the suspect game, which transforms a multi-player concurrent game into a two-player turn-based game which turns Nash equilibria into winning strategies (for some objective that depends on the preference relations of the players in the original game).
The determinacy of Blackwell games
Games of infinite length and perfect information have been studied for many years. There are numerous determinacy results for these games, and there is a wide body of work on consequences of their
On Repeated Games with Complete Information
TLDR
This work proves several properties of the sets of feasible payoffs and Nash equilibrium payoffs for the n-stage game and for the λ-discounted game and determines the set of equilibrium payoff for the Prisoner's Dilemma corresponding to the critical value of the discount factor.
Repeated Games
for every path a. The corresponding one-shot or stage game is denoted by G = ( {Ai}i=1, { fi}i=1 ) . The usual interpretation is that Ai is a set of pure actions.1 The set of feasible payoff vectors
...
...