Routing in an Uncertain World: Adaptivity, Efficiency, and Equilibrium

Autor: Vu, Dong Quan, Antonakopoulos, Kimon, Mertikopoulos, Panayotis

We consider the traffic assignment problem in nonatomic routing games where the players' cost functions may be subject to random fluctuations (e.g., weather disturbances, perturbations in the underlying network, etc.). We tackle this problem from the

Externí odkaz: http://arxiv.org/abs/2201.02985

Path Planning Problems with Side Observations-When Colonels Play Hide-and-Seek

Autor: Vu, Dong Quan, Loiseau, Patrick, Silva, Alonso, Tran-Thanh, Long

Resource allocation games such as the famous Colonel Blotto (CB) and Hide-and-Seek (HS) games are often used to model a large variety of practical problems, but only in their one-shot versions. Indeed, due to their extremely large strategy space, it

Externí odkaz: http://arxiv.org/abs/1911.09023

Combinatorial Bandits for Sequential Learning in Colonel Blotto Games

Autor: Vu, Dong Quan, Loiseau, Patrick, Silva, Alonso

Publikováno v: 58th IEEE Conference on Decision and Control (CDC), Dec 2019, Nice, France

The Colonel Blotto game is a renowned resource allocation problem with a long-standing literature in game theory (almost 100 years). However, its scope of application is still restricted by the lack of studies on the incomplete-information situations

Externí odkaz: http://arxiv.org/abs/1909.04912

UnderGrad: A universal black-box optimization method with almost dimension-free convergence rate guarantees

Autor: Antonakopoulos, Kimon, Vu, Dong Quan, Cevher, Vokan, Levy, Kfir, Mertikopoulos, Panayotis

Publikováno v: ICML 2022-39th International Conference on Machine Learning
ICML 2022-39th International Conference on Machine Learning, Jul 2022, Baltimore, United States. pp.1-31

31 pages, 4 figures, 1 table; International audience; Universal methods for optimization are designed to achieve theoretically optimal convergence rates without any prior knowledge of the problem's regularity parameters or the accurarcy of the gradie

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=od_______165::a972ebabb5f4cdf8259029fd19bb90b1
https://hal.science/hal-03874041/file/UnderGrad-ICML.pdf

A simple and efficient algorithm to compute epsilon-equilibria of discrete Colonel Blotto games

Autor: Vu, Dong Quan, Silva, Alonso, Quan Vu, Dong, Loiseau, Patrick

Publikováno v: AAMAS 2018-17th International Conference on Autonomous Agents and MultiAgent Systems
AAMAS 2018-17th International Conference on Autonomous Agents and MultiAgent Systems, Jul 2018, Stockholm, Sweden. pp.2115-2117

International audience; The Colonel Blotto game is a famous game commonly used to model resource allocation problems in domains ranging from security to advertising. Two players distribute a fixed budget of resources on multiple battlefields to maxim

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ded8992ec2e95102f8e72fcd2f0afa27
https://hal.archives-ouvertes.fr/hal-01955445/file/Vu-etal_ApproximateBlottoShort_AAMAS2018-nocopyright.pdf