HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Theses

Models and solutions of strategic resource allocation problems : approximate equilibrium and online learning in Blotto games

Abstract : Resource allocation problems are broadly defined as situations involving decisions on distributing a limited budget of resources in order to optimize an objective. In particular, many of them involve interactions between competitive decision-makers which can be well captured by game-theoretic models. In this thesis, we choose to investigate resource allocation games. We primarily focus on the Colonel Blotto game (CB game). In the CB game, two competitive players, each having a fixed budget of resources, simultaneously distribute their resources toward n battlefields. Each player evaluates each battlefield with a certain value. In each battlefield, the player who has the higher allocation wins and gains the corresponding value while the other loses and gains zero. Each player's payoff is her aggregate gains from all the battlefields. First, we model several prominent variants of the CB game and their extensions as one-shot complete-information games and analyze players' strategic behaviors. Our first main contribution is a class of approximate (Nash) equilibria in these games for which we prove that the approximation error can be well-controlled. Second, we model resource allocation games with combinatorial structures as online learning problems to study situations involving sequential plays and incomplete information. We make a connection between these games and online shortest path problems (OSP). Our second main contribution is a set of novel regret-minimization algorithms for generic instances of OSP under several restricted feedback settings that provide significant improvements in regret guarantees and running time in comparison with existing solutions.
Document type :
Theses
Complete list of metadata

https://tel.archives-ouvertes.fr/tel-03502593
Contributor : Abes Star :  Contact
Submitted on : Sunday, December 26, 2021 - 1:01:11 AM
Last modification on : Thursday, March 17, 2022 - 5:05:40 PM
Long-term archiving on: : Monday, March 28, 2022 - 9:19:11 AM

File

VU_Dong_Quan_2020.pdf
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-03502593, version 1

Citation

Dong Quan Vu. Models and solutions of strategic resource allocation problems : approximate equilibrium and online learning in Blotto games. Operations Research [cs.RO]. Sorbonne Université, 2020. English. ⟨NNT : 2020SORUS120⟩. ⟨tel-03502593⟩

Share

Metrics

Record views

91

Files downloads

21