Author of the publication

Colonel Blotto Games and Hide-and-Seek Games as Path Planning Problems with Side Observations.

, , , and . CoRR, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Colonel Blotto Games and Hide-and-Seek Games as Path Planning Problems with Side Observations., , , and . CoRR, (2019)Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights., , and . NeurIPS, page 14708-14720. (2021)UnderGrad: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees., , , , and . ICML, volume 162 of Proceedings of Machine Learning Research, page 772-795. PMLR, (2022)Combinatorial Bandits for Sequential Learning in Colonel Blotto Games., , and . CDC, page 867-872. IEEE, (2019)Models and Solutions of Strategic Resource Allocation Problems: Approximate Equilibrium and Online Learning in Blotto Games. (Modèles et Solutions de Problèmes d'Allocation de Ressources Stratégiques : Équilibre Approximatif et Apprentissage en Ligne dans les Jeux de Blotto).. Pierre and Marie Curie University, Paris, France, (2020)Path Planning Problems with Side Observations - When Colonels Play Hide-and-Seek., , , and . AAAI, page 2252-2259. AAAI Press, (2020)A Simple and Efficient Algorithm to Compute Epsilon-Equilibria of Discrete Colonel Blotto Games: Epsilon-Equilibria of Discrete Colonel Blotto Games., , and . AAMAS, page 2115-2117. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games., , and . IJCAI, page 519-526. ijcai.org, (2018)Colonel Blotto Games with Favoritism: Competitions with Pre-allocations and Asymmetric Effectiveness., and . EC, page 862-863. ACM, (2021)