D. G. Arce, D. Kovenock, and A. B. Roberson, Weakest-link attacker-defender games with multiple attack technologies, Naval Research Logistics (NRL), vol.59, pp.457-469, 2012.

J. Audibert, S. Bubeck, and A. G. Lugosi, Regret in online combinatorial optimization, Mathematics of Operations Research, vol.39, pp.31-45, 2014.

S. Behnezhad, S. Dehghani, M. Derakhshan, M. Haji-aghayi, and A. S. Seddighin, Faster and simpler algorithm for optimal strategies of Blotto game, AAAI, pp.369-375, 2017.

E. Borel, La théorie du jeu et leséquations intégralesà noyau symétrique, Comptes rendus de l'Académie des Sciences, vol.173, p.58, 1921.

N. Cesa-bianchi-and-g and . Lugosi, Combinatorial bandits, Journal of Computer and System Sciences, vol.78, pp.1404-1422, 2012.

P. H. Chia-and-j and . Chuang, Colonel blotto in the phishing war, International Conference on Decision and Game Theory for Security, pp.201-218, 2011.

R. Combes, M. S. Shahi, A. Proutiere, and E. T. Al, Combinatorial bandits revisited, Advances in Neural Information Processing Systems, pp.2116-2124, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01257796

O. Gross-and-r and . Wagner, A continuous Colonel Blotto game, 1950.

A. Gupta, G. Schwartz, C. Langbort, S. S. Sastry, and A. T. Ba?ar, A three-stage colonel blotto game with applications to cyberphysical security, American Control Conference (ACC), pp.3820-3825, 2014.

A. György, T. Linder, G. Lugosi, and A. G. Ottucsák, The on-line shortest path problem under partial monitoring, Journal of Machine Learning Research, vol.8, pp.2369-2403, 2007.

M. B. Hajimirsaadeghi-and-n and . Mandayam, A dynamic colonel blotto game model for spectrum sharing in wireless networks, 2017 55th Annual Allerton Conference on Communication, Control, and Computing, pp.287-294, 2017.

R. Hortala-vallve-and-a and . Llorente-saguer, Pure strategy nash equilibria in non-zero sum Colonel Blotto games, International Journal of Game Theory, pp.331-343, 2012.

Y. Hu, H. Qian, and A. Y. Yu, Sequential classification-based optimization for direct policy search, AAAI, pp.2029-2035, 2017.

Y. Liu, Y. Hu, H. Qian, Y. Yu, and A. C. Qian, Zoopt/zoojl: Toolbox for derivative-free optimization, 2017.

A. M. Masucci-and-a and . Silva, Strategic resource allocation for competitive influence in social networks, pp.951-958, 2014.

Y. Nesterov-and-a and . Nemirovsky, Interior-pointpolynomial methods in convexprogramming, tech. rep, 1994.

R. Powell and . Sequential, Allocating defensive resources prior to attack, Games and Economic Behavior, vol.67, pp.611-615, 2009.

B. Roberson, The Colonel Blotto game, Economic Theory, vol.29, pp.2-24, 2006.

S. Sakaue, M. Ishihata, and A. Minato, Efficient bandit combinatorial optimization algorithm with zero-suppressed binary decision diagrams, International Conference on Artificial Intelligence and Statistics, pp.585-594, 2018.

G. Schwartz, P. Loiseau, and S. S. Sastry, The heterogeneous Colonel Blotto game, NetGCoop, pp.232-238, 2014.

E. K. Takimoto-and-m and . Warmuth, Path kernels and multiplicative updates, vol.4, pp.773-818, 2003.

L. Vandenberghe-and-s and . Boyd, Semidefinite programming, SIAM review, vol.38, pp.49-95, 1996.

D. Q. Vu, P. Loiseau, and A. A. Silva, Efficient computation of approximate equilibria in discrete Colonel Blotto games, IJCAI-ECAI, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01787505

D. Q. Vu, P. Loiseau, A. Silva, and A. L. Tran-thanh, Colonel blotto and hide-and-seek games as path planning problems with side observations, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02139519