output
20162022
most citedOptimistic mirror descent in saddle-point problems: Going the extra (gradient) mile

114 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing cs.GTShow all

5 papers · 1 filter

cs.GT2022

Fairness in Selection Problems with Strategic Candidates

Vitalii Emelianov, Nicolas Gast, Patrick Loiseau

To better understand discriminations and the effect of affirmative actions in selection problems (e.g., college admission or hiring), a recent line of research proposed a model bas…

cs.GT2019★ 5 cited

Approximate Equilibria in Generalized Colonel Blotto and Generalized Lottery Blotto Games

Dong Quan Vu, Patrick Loiseau, Alonso Silva

In the Colonel Blotto game, two players with a fixed budget simultaneously allocate their resources across n battlefields to maximize the aggregate value gained from the battlefiel…

cs.GT2019

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

Dong Quan Vu, Patrick Loiseau, Alonso Silva +1

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-s…

cs.GT2018★ 28 cited

Bandit learning in concave -person games

Mario Bravo, David S. Leslie, Panayotis Mertikopoulos

This paper examines the long-run behavior of learning with bandit feedback in non-cooperative concave games. The bandit framework accounts for extremely low-information environment…

cs.GT2018★ 10 cited

Multi-agent online learning in time-varying games

Benoit Duvocelle, Panayotis Mertikopoulos, Mathias Staudigl +1

We examine the long-run behavior of multi-agent online learning in games that evolve over time. Specifically, we focus on a wide class of policies based on mirror descent, and we s…