Dong Quan Vu

Orcid: 0000-0003-2276-8873

According to our database1, Dong Quan Vu authored at least 12 papers between 2018 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Routing in an Uncertain World: Adaptivity, Efficiency, and Equilibrium.
CoRR, 2022

UnderGrad: A Universal Black-Box Optimization Method with Almost Dimension-Free Convergence Rate Guarantees.
Proceedings of the International Conference on Machine Learning, 2022

2021
Colonel Blotto Games with Favoritism: Competitions with Pre-allocations and Asymmetric Effectiveness.
Proceedings of the EC '21: The 22nd ACM Conference on Economics and Computation, 2021

Fast Routing under Uncertainty: Adaptive Learning in Congestion Games via Exponential Weights.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

2020
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).
PhD thesis, 2020

A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales.
Comput. Oper. Res., 2020

Path Planning Problems with Side Observations - When Colonels Play Hide-and-Seek.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Approximate Equilibria in Non-constant-sum Colonel Blotto and Lottery Blotto Games with Large Numbers of Battlefields.
CoRR, 2019

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

Combinatorial Bandits for Sequential Learning in Colonel Blotto Games.
Proceedings of the 58th IEEE Conference on Decision and Control, 2019

2018
Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

A Simple and Efficient Algorithm to Compute Epsilon-Equilibria of Discrete Colonel Blotto Games: Epsilon-Equilibria of Discrete Colonel Blotto Games.
Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, 2018


  Loading...