default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDong Quan Vu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c7]Kimon Antonakopoulos, Dong Quan Vu, Volkan Cevher
, Kfir Y. Levy, Panayotis Mertikopoulos:
UnderGrad: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees. ICML 2022: 772-795- [i5]Dong Quan Vu, Kimon Antonakopoulos, Panayotis Mertikopoulos:
Routing in an Uncertain World: Adaptivity, Efficiency, and Equilibrium. CoRR abs/2201.02985 (2022) - 2021
- [c6]Dong Quan Vu, Kimon Antonakopoulos, Panayotis Mertikopoulos:
Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights. NeurIPS 2021: 14708-14720 - [c5]Dong Quan Vu, Patrick Loiseau:
Colonel Blotto Games with Favoritism: Competitions with Pre-allocations and Asymmetric Effectiveness. EC 2021: 862-863 - [i4]Dong Quan Vu, Patrick Loiseau:
Colonel Blotto Games with Favoritism: Competitions with Pre-allocations and Asymmetric Effectiveness. CoRR abs/2106.00617 (2021) - 2020
- [b1]Dong Quan Vu:
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 - [j1]Franco Quezada, Céline Gicquel, Safia Kedad-Sidhoum, Dong Quan Vu:
A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales. Comput. Oper. Res. 116: 104865 (2020) - [c4]Dong Quan Vu, Patrick Loiseau, Alonso Silva, Long Tran-Thanh:
Path Planning Problems with Side Observations - When Colonels Play Hide-and-Seek. AAAI 2020: 2252-2259
2010 – 2019
- 2019
- [c3]Dong Quan Vu, Patrick Loiseau, Alonso Silva:
Combinatorial Bandits for Sequential Learning in Colonel Blotto Games. CDC 2019: 867-872 - [i3]Dong Quan Vu, Patrick Loiseau, Alonso Silva, Long Tran-Thanh:
Colonel Blotto Games and Hide-and-Seek Games as Path Planning Problems with Side Observations. CoRR abs/1905.11151 (2019) - [i2]Dong Quan Vu, Patrick Loiseau, Alonso Silva:
Combinatorial Bandits for Sequential Learning in Colonel Blotto Games. CoRR abs/1909.04912 (2019) - [i1]Dong Quan Vu, Patrick Loiseau, Alonso Silva:
Approximate Equilibria in Non-constant-sum Colonel Blotto and Lottery Blotto Games with Large Numbers of Battlefields. CoRR abs/1910.06559 (2019) - 2018
- [c2]Dong Quan Vu, Patrick Loiseau, Alonso Silva:
A Simple and Efficient Algorithm to Compute Epsilon-Equilibria of Discrete Colonel Blotto Games: Epsilon-Equilibria of Discrete Colonel Blotto Games. AAMAS 2018: 2115-2117 - [c1]Dong Quan Vu, Patrick Loiseau, Alonso Silva:
Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games. IJCAI 2018: 519-526
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:54 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
