J. Abernathy, P. L. Bartlett, and E. Hazan, Blackwell approachability and low-regret learning are equivalent, Proceedings of the 24th Annual Conference on Learning Theory Conference Proceedings, pp.27-46, 2011.

S. A. Soulaimani, M. Quincampoix, and S. Sorin, Repeated games and qualitative differential games: approachability and comparison of strategies, SIAM J. Control Optim, vol.48, pp.2461-2479, 2009.

P. Auer, N. Cesa-bianchi, and C. Gentile, Adaptive and self-confident on-line learning algorithms, J. Comput. System Sci, vol.64, pp.48-75, 2000.

R. J. Aumann, Subjectivity and correlation in randomized strategies, J. Math. Econom, vol.1, pp.67-96, 1974.

R. J. Aumann and M. B. Maschler, Repeated Games with Incomplete Information With the collaboration of Richard E. Stearns (contains a reedition of chapters of Reports to the US Arms Control and Disarmament Angency ST-80, 116 and 143, 1966.

M. Benaïm and M. Faure, Consistency of vanishingly smooth fictitious play, Math. Oper. Res

M. Benaïm, J. Hofbauer, and S. Sorin, Stochastic approximations and differential inclusions, II. Applications. Math. Oper. Res, vol.31, pp.673-695, 2006.

L. J. Billera and B. Sturmfels, Fiber polytopes, The Annals of Mathematics, vol.135, issue.3, pp.527-549, 1992.
DOI : 10.2307/2946575

D. Blackwell, An analog of the minimax theorem for vector payoffs, Pacific J. Math, vol.6, pp.1-8, 1956.

D. Blackwell, Controlled random walks, Proceedings of the International Congress of Mathematicians, pp.336-338, 1954.

A. Blum and Y. Mansour, From external to internal regret, Learning theory, pp.621-636, 2005.

S. Bubeck, Introduction to online optimization. manuscript, 2012.

N. Cesa-bianchi and G. Lugosi, Potential-based algorithms in on-line prediction and game theory, Machine Learning, pp.239-261, 2003.

X. Chen and H. White, Laws of large numbers for Hilbert space-valued mixingales with applications, Econometric Theory, vol.12, pp.284-304, 1996.

A. P. Dawid, The well-calibrated Bayesian, J. Amer. Statist. Assoc, vol.77, pp.605-613, 1982.

A. P. Dawid, Self-calibrating priors do not exist: Comment, J. Amer. Statist. Assoc, vol.80, pp.340-341, 1985.

K. Fan, Minimax theorems, Proc. Nat. Acad. Sci. U. S. A, pp.42-47, 1953.

K. Fan, A minimax inequality and applications, Inequalities, III (Proc. Third Sympos, pp.103-113, 1969.

W. Feller, An Introduction to Probability Theory and its Applications, 1968.

D. Foster, A proof of calibration via blackwell's approachability theorem, Games and Economic Behavior, vol.29, pp.73-78, 1999.

D. P. Foster, A. Rakhlin, K. Sridharan, and A. Tewari, Complexity-based approach to calibration with checking rules, Proceedings of the 24th Annual Conference on Learning Theory Conference Proceedings, pp.293-314, 2011.

D. P. Foster and R. V. Vohra, Calibrated learning and correlated equilibrium, Games Econom. Behav, vol.21, pp.40-55, 1997.

D. P. Foster and R. V. Vohra, Asymptotic calibration, Biometrika, vol.85, pp.379-390, 1998.

D. P. Foster and R. V. Vohra, Regret in the on-line decision problem, Games Econom. Behav, vol.29, pp.7-35, 1999.

D. Fudenberg and D. M. Kreps, Learning mixed equilibria, Games Econom. Behav, vol.5, pp.320-367, 1993.

D. Fudenberg and D. Levine, An easier way to calibrate Learning in games: a symposium in honor of, Games Econom. Behav, vol.29, pp.131-137, 1999.

D. Fudenberg and D. K. Levine, Conditional universal consistency, Games Econom. Behav, vol.29, pp.104-130, 1999.
DOI : 10.1006/game.1998.0705
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.9002

P. Hall and C. C. Heyde, Martingale Limit Theory and its Application, Probability and Mathematical Statistics, 1980.

J. Hannan, Approximation to Bayes risk in repeated play, Contributions to the Theory of Games, pp.97-139, 1957.

S. Hart and A. Mas, A simple adaptive procedure leading to correlated equilibrium, Econometrica, vol.68, pp.1127-1150, 2000.

S. Hart and A. Mas, A general class of adaptive strategies, J. Econom. Theory, vol.98, pp.26-54, 2001.

S. Hart and A. Mas, Regret-based continuous-time dynamics, Games Econom. Behav, vol.45, pp.375-394, 2003.
DOI : 10.1142/9789814390705_0005

E. Hazan and S. M. Kakade, (weak) calibration is computationaly hard, Proceedings of the 25th Annual Conference on Learning Theory, pp.3-4, 2012.

J. Hofbauer and W. H. Sandholm, On the global convergence of stochastic fictitious play, Econometrica, vol.70, pp.2265-2294, 2002.

J. Hofbauer, S. Sorin, and Y. Viossat, Time average replicator and best-reply dynamics, Math. Oper. Res, vol.34, pp.263-269, 2009.
DOI : 10.1287/moor.1080.0359
URL : https://hal.archives-ouvertes.fr/hal-00360767

S. M. Kakade and D. P. Foster, Deterministic calibration and Nash equilibrium, Learning theory, pp.33-48, 2004.

O. Kallenberg and R. Sztencel, Some dimension-free features of vector-valued martingales . Probability Theory and Related Fields, pp.215-247, 1991.

E. Kohlberg, Optimal strategies in repeated games with incomplete information, Internat. J. Game Theory, vol.4, pp.7-24, 1975.

J. Kwon, Hilbert distance, bounded convex functions, and application to the exponential weight algorithm, 2012.

E. Lehrer, Any inspection is manipulable, Econometrica, vol.69, pp.1333-1347, 2001.

E. Lehrer, Approachability in infinite dimensional spaces, Internat. J. Game Theory, vol.31, pp.253-268, 2002.

E. Lehrer, A wide range no-regret theorem. Games Econom, Behav, vol.42, pp.101-115, 2003.

E. Lehrer and E. Solan, Excludability and bounded computational capacity, Math. Oper. Res, vol.31, pp.637-648, 2006.

E. Lehrer and E. Solan, Learning to play partially-specified equilibrium. manuscript, 2007.

E. Lehrer and E. Solan, Approachability with bounded memory, Games Econom. Behav, vol.66, pp.995-1004, 2009.
DOI : 10.1016/j.geb.2007.07.011

N. Littlestone and M. Warmuth, The weighted majority algorithm, Information and Computation, vol.108, pp.212-261, 1994.

R. D. Luce and H. Raiffa, Games and Decisions: Introduction and Critical Survey, 1957.

S. Mannor and N. Shimkin, Regret minimization in repeated matrix games with variable stage duration, Games Econom. Behav, vol.63, pp.227-258, 2008.

S. Mannor and G. Stoltz, A geometric proof of calibration, Math. Oper. Res, vol.35, pp.721-727, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00586044

S. Mannor, G. Stoltz, and V. Perchet, Robust approachability and regret minimization in games with partial monitoring, Proceedings of the 24th Annual Conference on Learning Theory Conference Proceedings, pp.515-536, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00595695

S. Mannor, G. Stoltz, and V. Perchet, Set-valued approachability, with applications to regret minimization in games with partial monitoring. manuscript, 2012.

S. Mannor and J. N. Tsitsiklis, Approachability in repeated games: computational aspects and a Stackelberg variant, Games Econom. Behav, vol.66, pp.315-325, 2009.

D. Mcfadden, Conditional logit analysis of qualitative choice behavior, Frontiers in econometrics, pp.105-142, 1974.

J. Neveu, Martingales à Temps Discret, 1972.

D. Oakes, Self-calibrating priors do not exist, J. Amer. Statist. Assoc, vol.80, pp.339-342, 1985.

W. Olszewski, Calibration and expert testing, Handbook of Game Theory, 2012.
DOI : 10.1016/b978-0-444-53766-9.00018-5

V. Perchet, Calibration and internal no-regret with random signals, Proceedings of the 20th International Conference on Algorithmic Learning Theory, pp.68-82, 2009.

V. Perchet, Approachability, Calibration and Regret in Games with Partial Observations, 2010.
URL : https://hal.archives-ouvertes.fr/tel-00567079

V. Perchet, Approachability of convex sets in games with partial monitoring, J. Optim. Theory Appl, vol.149, pp.665-677, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00490434

V. Perchet, No-regret with partial monitoring: Calibration-based optimal algorithms, J. Mach. Learn. Res, vol.12, pp.1893-1921, 2011.

V. Perchet and M. Quincampoix, Purely informative game: Application to approachability with partial monitoring. manuscript, 2012.

A. Rakhlin, Lecture notes on online learning. manuscript, 2009.

A. Rakhlin, K. Sridharan, and A. Tewari, Online learning: random averages, combinatorial parameters, and learnability, NIPS, 2010.

A. Rakhlin, K. Sridharan, and A. Tewari, Online learning: Beyond regret, Proceedings of the 24th Annual Conference on Learning Theory Conference Proceedings, pp.559-594, 2011.

W. Rudin, Real and Complex Analysis. McGraw-Hill Series in Higher Mathematics, 1974.

A. Sandroni, R. Smorodinsky, and R. V. Vohra, Calibration with many checking rules, Math. Oper. Res, vol.28, pp.141-153, 2003.
DOI : 10.1287/moor.28.1.141.14264

E. Seneta, Nonnegative Matrices and Markov Chains Springer Series in Statistics, 1981.

S. Sorin, A First Course on Zero-Sum Repeated Games, 2002.

S. Sorin, Exponential weight algorithm in continuous time, Math. Program, vol.116, pp.513-528, 2009.

X. Spinat, A necessary and sufficient condition for approachability, Math. Oper. Res, vol.27, pp.31-44, 2002.

G. Stoltz, Incomplete information and internal regret in prediction of individual sequences, 2005.
URL : https://hal.archives-ouvertes.fr/tel-00009759

G. Stoltz and G. Lugosi, Internal regret in on-line portfolio selection, Mach. Learn, vol.59, pp.125-159, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00007535

G. Stoltz and G. Lugosi, Learning correlated equilibria in games with compact sets of strategies, Games Econom. Behav, vol.59, pp.187-208, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00007536

N. Vieille, Weak approachability, Math. Oper. Res, vol.17, pp.781-791, 1992.
DOI : 10.1287/moor.17.4.781
URL : https://hal.archives-ouvertes.fr/hal-00481891

Y. Viossat and A. Zapechelnyuk, No-regret dynamics and fictitious play
DOI : 10.1016/j.jet.2012.07.003
URL : https://hal.archives-ouvertes.fr/hal-00713871

V. Vovk, Aggregating strategies, Proceedings of the 3rd Annual Workshop on Computational Learning Theory, pp.372-383, 1990.
DOI : 10.1016/b978-1-55860-146-8.50032-1

V. Vovk, I. Nouretdinov, A. Takemura, and G. Shafer, Defensive forecasting for linear protocols, Algorithmic learning theory, pp.459-473, 2005.

D. Walkup and R. J. Wets, A lipschitzian characterization of convex polyhedra, Proceedings of the, pp.167-173, 1969.

A. Zapechelnyuk, Better-reply dynamics with bounded recall, Math. Oper. Res, vol.33, pp.869-879, 2008.

M. Zinkevich, Online convex programming and generalized infinitesimal gradient ascent, Proceedings of the Twentieth International Conference on Machine Learning, 2003.