J. Abernethy, P. L. Bartlett, and E. Hazan, Blackwell approachability and no-regret learning are equivalent, Proceedings of COLT, pp.27-46, 2011.

P. Auer, N. Cesa-bianchi, Y. Freund, and R. E. Schapire, The Nonstochastic Multiarmed Bandit Problem, SIAM Journal on Computing, vol.32, issue.1, pp.48-77, 2002.
DOI : 10.1137/S0097539701398375

Y. Azar, U. Feige, M. Feldman, and M. Tennenholtz, Sequential decision making with vector outcomes, Proceedings of the 5th conference on Innovations in theoretical computer science, ITCS '14, 2014.
DOI : 10.1145/2554797.2554817

A. Bernstein and N. Shimkin, Response-based approachability with applications to generalized no-regret problems, Journal of Machine Learning Research, vol.16, pp.747-773, 2015.

A. Bernstein, S. Mannor, and N. Shimkin, Opportunistic strategies for generalized no-regret problems, Proceedings of COLT, pp.158-171, 2013.

D. Blackwell, An analog of the minimax theorem for vector payoffs, Pacific Journal of Mathematics, vol.6, issue.1, pp.1-8, 1956.
DOI : 10.2140/pjm.1956.6.1

S. Boyd and L. Vandenberghe, Convex Optimization, 2004.

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

N. Cesa-bianchi, Y. Mansour, and G. Stoltz, Improved second-order bounds for prediction with expert advice, Machine Learning, pp.321-352, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00019799

S. De-rooij, T. Van-erven, P. D. Grünwald, and W. Koolen, Follow the leader if you can, hedge if you must, Journal of Machine Learning Research, vol.15, pp.1281-1316, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00920549

E. Even-dar, R. Kleinberg, S. Mannor, and Y. Mansour, Online learning for global cost functions, Proceedings of COLT, 2009.

D. Foster and R. Vohra, Asymptotic calibration, Biometrika, vol.85, issue.2, pp.379-390, 1998.
DOI : 10.1093/biomet/85.2.379

D. P. Helmbold and M. Warmuth, Tracking the best expert, Machine Learning, pp.151-178, 1998.

J. Hiriart-urruty and C. Lemaréchal, Fundamentals of Convex Analysis, 2001.
DOI : 10.1007/978-3-642-56468-0

T. Hou, Approachability in a two-person game. The Annals of Mathematical Statistics, pp.735-744, 1971.

S. Mannor and G. Stoltz, A Geometric Proof of Calibration, Mathematics of Operations Research, vol.35, issue.4, pp.721-727, 2010.
DOI : 10.1287/moor.1100.0465
URL : https://hal.archives-ouvertes.fr/hal-00586044

S. Mannor and J. N. Tsitsiklis, Approachability in repeated games: Computational aspects and a Stackelberg variant, Games and Economic Behavior, vol.66, issue.1, pp.315-325, 2009.
DOI : 10.1016/j.geb.2008.03.008

S. Mannor, J. N. Tsitsiklis, and J. Y. Yu, Online learning with sample path constraints, Journal of Machine Learning Research, vol.10, pp.569-590, 2009.

S. Mannor, V. Perchet, and G. Stoltz, Set-valued approachability and online learning with partial monitoring, Journal of Machine Learning Research, vol.15, pp.3247-3295, 2014.

V. Perchet, Approachability, regret and calibration: Implications and equivalences, Journal of Dynamics and Games, vol.1, issue.2, pp.181-254, 2014.
DOI : 10.3934/jdg.2014.1.181
URL : https://hal.archives-ouvertes.fr/hal-00773218

X. Spinat, A Necessary and Sufficient Condition for Approachability, Mathematics of Operations Research, vol.27, issue.1, pp.31-44, 2002.
DOI : 10.1287/moor.27.1.31.333