论文信息 - Approachability in repeated games: Computational aspects and a Stackelberg variant - 字舞流文

Approachability in repeated games: Computational aspects and a Stackelberg variant

John N. Tsitsiklis | Shie Mannor | Shie Mannor | J. Tsitsiklis

[1] Xavier Spinat,et al. A Necessary and Sufficient Condition for Approachability , 2002, Math. Oper. Res..

[2] Andreu Mas-Colell,et al. A General Class of Adaptive Strategies , 1999, J. Econ. Theory.

[3] Dean P. Foster,et al. A Proof of Calibration Via Blackwell's Approachability Theorem , 1999 .

[4] A. Rustichini. Minimizing Regret : The General Case , 1999 .

[5] D. Bertsimas,et al. Optimal control of execution costs , 1998 .

[6] John N. Tsitsiklis,et al. Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[7] A. Shwartz,et al. Guaranteed performance regions in Markovian systems with competing decision makers , 1993, IEEE Trans. Autom. Control..

[8] Katta G. Murty,et al. Some NP-complete problems in quadratic and nonlinear programming , 1987, Math. Program..

[9] L. Khachiyan,et al. The polynomial solvability of convex quadratic programming , 1980 .

[10] D. Blackwell. An analog of the minimax theorem for vector payoffs. , 1956 .