Weak Approachability

DOI10.1287/moor.17.4.781zbMath0777.90093OpenAlexW2913132015MaRDI QIDQ4027793

Nicolas Vieille

Publication date: 1 March 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.17.4.781

zbMATH Keywords

weak approachabilityrepeated games with vector payoffsdifferential games with fixed durationweak excludability

Mathematics Subject Classification ID

2-person games (91A05) Differential games (aspects of game theory) (91A23) Multistage and repeated games (91A20)

Related Items (17)

Approachability in population games ⋮ Approachability with bounded memory ⋮ Approachability of convex sets in generalized quitting games ⋮ Robust mean field games ⋮ Asymptotically optimal strategies in repeated games with incomplete information and vanishing weights ⋮ Absorption paths and equilibria in quitting games ⋮ Approachability of convex sets in games with partial monitoring ⋮ Approachability, regret and calibration: implications and equivalences ⋮ Repeated Games with Incomplete Information ⋮ Zero-sum repeated games: recent advances and new links with differential games ⋮ A differential game on Wasserstein space. Application to weak approachability with partial monitoring ⋮ A Robust Saturated Strategy for $n$-Player Prisoner's Dilemma ⋮ Asymptotic value in frequency-dependent games with separable payoffs: a differential approach ⋮ Approachability with constraints ⋮ Markov Games with Frequent Actions and Incomplete Information—The Limit Case ⋮ Limit Value of Dynamic Zero-Sum Games with Vanishing Stage Duration ⋮ Regret in the on-line decision problem

This page was built for publication: Weak Approachability