• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

Acyclic Gambling Game

Laraki, Rida; Renault, Jérôme (2017), Acyclic Gambling Game, Mathematics of Operations Research, 45, 4, p. 1193-1620. 10.2139/ssrn.3187425

View/Open
156940660469555.pdf (450.4Kb)
Type
Article accepté pour publication ou publié
Date
2017
Journal name
Mathematics of Operations Research
Volume
45
Number
4
Publisher
INFORMS
Pages
1193-1620
Publication identifier
10.2139/ssrn.3187425
Metadata
Show full item record
Author(s)
Laraki, Rida cc
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Renault, Jérôme
Abstract (EN)
We consider 2-player zero-sum stochastic games where each player controls his own state variable living in a compact metric space. The terminology comes from gambling problems where the state of a player represents its wealth in a casino. Under natural assumptions (such as continuous running payoff and non expansive transitions), we consider for each discount factor the value vλ of the λ-discounted stochastic game and investigate its limit when λ goes to 0 (players are more and more patient). We show that under a new acyclicity condition, the limit exists and is characterized as the unique solution of a system of functional equations: the limit is the unique continuous excessive and depressive function such that each player, if his opponent does not move, can reach the zone when the current payoff is at least as good than the limit value, without degrading the limit value. The approach generalizes and provides a new viewpoint on the Mertens-Zamir system coming from the study of zero-sum repeated games with lack of information on both sides. A counterexample shows that under a slightly weaker notion of acyclicity, convergence of (vλ) may fail.
Subjects / Keywords
Markov Decision Processes; Zero-Sum Stochastic Games; Asymptotic Value; Gambling Houses; Mertens-Zamir System; Splitting Games; Persuasion

Related items

Showing items related by title and author.

  • Thumbnail
    Mathematical Foundations of Game Theory 
    Laraki, Rida; Renault, Jérôme; Sorin, Sylvain (2019) Ouvrage
  • Thumbnail
    Special issue in honor of the 60th birthday of Sylvain Sorin 
    Hofbauer, Josef; Laraki, Rida; Renault, Jérôme (2014) Article accepté pour publication ou publié
  • Thumbnail
    Learning in nonatomic games, Part I: Finite action spaces and population games 
    Hadikhanloo, Saeed; Laraki, Rida; Mertikopoulos, Panayotis; Sorin, Sylvain (2021) Document de travail / Working paper
  • Thumbnail
    On the Existence of Approximate Equilibria and Sharing Rule Solutions in Discontinuous Games 
    Bich, Philippe; Laraki, Rida (2017) Article accepté pour publication ou publié
  • Thumbnail
    Inertial Game Dynamics and Applications to Constrained Optimization 
    Laraki, Rida; Mertikopoulos, Panayotis (2015) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo