Approachability in repeated games: Computational aspects and a Stackelberg variant

DOI10.1016/j.geb.2008.03.008zbMath1161.91320OpenAlexW2057841929MaRDI QIDQ1021600

Shie Mannor, John N. Tsitsiklis

Publication date: 8 June 2009

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

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

Mathematics Subject Classification ID

Multistage and repeated games (91A20) Decision theory for games (91A35) Theory of computing (68Q99)

Related Items (1)

Approachability, regret and calibration: implications and equivalences

Cites Work

• Unnamed Item
• An analog of the minimax theorem for vector payoffs
• Some NP-complete problems in quadratic and nonlinear programming
• A general class of adaptive strategies

This page was built for publication: Approachability in repeated games: Computational aspects and a Stackelberg variant