Attainability in Repeated Games with Vector Payoffs

DOI10.1287/moor.2014.0693zbMath1377.91027arXiv1201.6054OpenAlexW2100674594MaRDI QIDQ3449457

Ehud Lehrer, Dario Bauso, Eilon Solan, Xavier Venel

Publication date: 4 November 2015

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

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

zbMATH Keywords

dynamic gamesrepeated gamesapproachabilitycontinuous timeattainabilityvector payoffs

Mathematics Subject Classification ID

2-person games (91A05) Inventory, storage, reservoirs (90B05) Multistage and repeated games (91A20)

Related Items

Approachability in population games ⋮ Attainability in Repeated Games with Vector Payoffs ⋮ Opinion Dynamics in Social Networks through Mean-Field Games ⋮ Consensus in opinion dynamics as a repeated game ⋮ Robust mean field games ⋮ Adaptation, coordination, and local interactions via distributed approachability ⋮ A Robust Saturated Strategy for $n$-Player Prisoner's Dilemma ⋮ Approachability with constraints ⋮ Opportunistic Approachability and Generalized No-Regret Problems

Cites Work

• An analog of the minimax theorem for vector payoffs
• Set invariance in control
• A robust optimization approach to dynamic pricing and inventory control with no backorders
• Robust control strategies for multi--inventory systems with average flow constraints
• On the minimax reachability of target sets and target tubes
• A Robust Optimization Approach to Inventory Theory
• Two-Stage Robust Network Flow and Design Under Demand Uncertainty
• Attainability in Repeated Games with Vector Payoffs
• Repeated Games and Qualitative Differential Games: Approachability and Comparison of Strategies
• Control of production-distribution systems with unknown inputs and system failures
• Optimization of Long-Run Average-Flow Cost in Networks With Time-Varying Unknown Demand
• Approachability in a Two-person Game
• A Necessary and Sufficient Condition for Approachability