Approachability with bounded memory

DOI10.1016/j.geb.2007.07.011zbMath1165.91323OpenAlexW2014335617MaRDI QIDQ2389319

Eilon Solan, Ehud Lehrer

Publication date: 15 July 2009

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.geb.2007.07.011

zbMATH Keywords

automataadaptive learningrepeated gamesapproachabilitybounded memorybounded recallvector payoffsno-regret

Mathematics Subject Classification ID

Multistage and repeated games (91A20)

Related Items (10)

Robust mean field games ⋮ Dynamic benchmark targeting ⋮ Regret matching with finite memory ⋮ Constrained no-regret learning ⋮ Limits of correlation in repeated games with bounded memory ⋮ Approachability with delayed information ⋮ Approachability, regret and calibration: implications and equivalences ⋮ Smooth calibration, leaky forecasts, finite recall, and Nash dynamics ⋮ Approachability with constraints ⋮ Opportunistic Approachability and Generalized No-Regret Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma
• An analog of the minimax theorem for vector payoffs
• Finite automata play the repeated prisoner's dilemma
• Repeated games with stationary bounded recall strategies
• The complexity of computing a best response automaton in repeated games with mixed strategies
• Cooperation in the infinitely repeated prisoners' dilemma with perturbations
• A wide range no-regret theorem
• Regret in the on-line decision problem
• Conditional universal consistency.
• Minimizing regret: The general case
• Limited horizon forecast in repeated alternate games
• Better-Reply Dynamics with Bounded Recall
• Finite Rationality and Interpersonal Complexity in Repeated Games
• Weak Approachability
• A Simple Adaptive Procedure Leading to Correlated Equilibrium
• Excludability and Bounded Computational Capacity
• Prediction, Learning, and Games
• Weak Approachability in a Two-Person Game
• Approachability in a Two-person Game
• A Necessary and Sufficient Condition for Approachability

This page was built for publication: Approachability with bounded memory