Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 32 min ago
PreprintarXiv licencearXiv

Robust Optimization in Stochastic Games

Abstract

A player's impatient valuation of an infinite stream of stage payoffs is a weighted average with nonincreasing weights. Such valuations generalize geometric discounting and allow imprecise or heterogeneous time preferences. For a stochastic game Γ and a profile u of impatient valuations, let Γu be the induced game. We ask when approximately optimal or equilibrium behavior can be chosen to vary continuously and stably with u. We show that this robustness is governed by the corresponding uniform long-run payoff property: the uniform value in the adversary case, and uniform approximate equilibrium payoffs in the equilibrium case. In finite state spaces, the latter is equivalent to the usual existence of a uniform equilibrium payoff. In the two-player zero-sum case, if Γ has a uniform value, then the value of Γu varies uniformly continuously with u, and for every ε>0 there is a uniformly continuous mapping assigning to each u an ε-optimal strategy in Γu. Hence this holds for every finite two-player zero-sum stochastic game. In the non-zero-sum case, uniform approximate equilibrium payoffs imply a finite cover of the valuation-profile space by neighborhoods on each of which a single strategy profile is a robust ε-equilibrium. For sunspot, correlated, and extensive-form correlated equilibria, uniform approximate equilibrium payoffs are equivalent to the existence, for every ε>0, of a uniformly continuous mapping assigning to each valuation profile a robust ε-equilibrium on a neighborhood of that profile. Consequently, every finite stochastic game admits uniformly continuous robust extensive-form correlated ε-equilibrium selections.

Related

  1. Noise-Robust Distributed Optimization Over Directed Graphs With Row Stochastic Matrices
    Yifan Wang, Mufeng Wang, Xianghui Cao
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  2. Moment Ambiguity and the Limits of Robust Stochastic Optimization
    Andrés Cristi, Matteo Russo, Jiechen Zhang
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  3. A Composite Bayesian Risk--Distributionally Robust Optimization Model for Stochastic Programming with Elliptical Distribution Ambiguity
    Renjie Chen, Huifu Xu
    arXivPreprintCC BY 4.0Full textOptimisation & controlStatisticsarXiv
  4. Maximum principle for discrete-time stochastic recursive games driven by fractional noises
    Yuecai Han, Yuhang Li, Chenfei Wang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  5. Stochastic differential games with random coefficients and state constraints: associated stochastic Hamilton-Jacobi-Bellman-Isaacs equations with Neumann boundary conditions
    Rainer Buckdahn, Juan Li, Yanwei Li
    arXivPreprintCC BY 4.0Full textProbabilityarXiv
BibTeX
@misc{neyman2026robust,
  title = {{Robust Optimization in Stochastic Games}},
  author = {Abraham Neyman},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.01151},
  eprint = {2611.01151},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.01151},
}
RIS
TY  - UNPB
TI  - Robust Optimization in Stochastic Games
AU  - Abraham Neyman
PY  - 2026
DA  - 2026/11/01
PB  - arXiv
DO  - 10.48550/arxiv.2611.01151
UR  - https://arxiv.org/abs/2611.01151
AB  - A player's impatient valuation of an infinite stream of stage payoffs is a weighted average with nonincreasing weights. Such valuations generalize geometric discounting and allow imprecise or heterogeneous time preferences. For a stochastic game Γ and a profile u of impatient valuations, let Γ_u be the induced game. We ask when approximately optimal or equilibrium behavior can be chosen to vary continuously and stably with u. We show that this robustness is governed by the corresponding uniform long-run payoff property: the uniform value in the adversary case, and uniform approximate equilibrium payoffs in the equilibrium case. In finite state spaces, the latter is equivalent to the usual existence of a uniform equilibrium payoff. In the two-player zero-sum case, if Γ has a uniform value, then the value of Γ_u varies uniformly continuously with u, and for every ε>0 there is a uniformly continuous mapping assigning to each u an ε-optimal strategy in Γ_u. Hence this holds for every finite two-player zero-sum stochastic game. In the non-zero-sum case, uniform approximate equilibrium payoffs imply a finite cover of the valuation-profile space by neighborhoods on each of which a single strategy profile is a robust ε-equilibrium. For sunspot, correlated, and extensive-form correlated equilibria, uniform approximate equilibrium payoffs are equivalent to the existence, for every ε>0, of a uniformly continuous mapping assigning to each valuation profile a robust ε-equilibrium on a neighborhood of that profile. Consequently, every finite stochastic game admits uniformly continuous robust extensive-form correlated ε-equilibrium selections.
ER  -