139 citations · 615 across the 107 of their papers we have counts for
6 papers · 1 filter
Local and adaptive mirror descents in extensive-form games
Côme Fiegel, Pierre Ménard, Tadashi Kozuno +3
We study how to learn -optimal strategies in zero-sum imperfect information games (IIG) with trajectory feedback. In this setting, players update their policies sequentially bas…
Trading-off price for data quality to achieve fair online allocation
Mathieu Molina, Nicolas Gast, Patrick Loiseau +1
We consider the problem of online allocation subject to a long-term fairness penalty. Contrary to existing works, however, we do not assume that the decision-maker observes the pro…
Online Matching in Geometric Random Graphs
Flore Sentenac, Nathan Noiry, Matthieu Lerasle +2
We investigate online maximum cardinality matching, a central problem in ad allocation. In this problem, users are revealed sequentially, and each new user can be paired with any p…
DU-Shapley: A Shapley Value Proxy for Efficient Dataset Valuation
Felipe Garrido-Lucero, Benjamin Heymann, Maxime Vono +2
We consider the dataset valuation problem, that is, the problem of quantifying the incremental gain, to some relevant pre-defined utility of a machine learning task, of aggregating…
Constant or logarithmic regret in asynchronous multiplayer bandits
Hugo Richard, Etienne Boursier, Vianney Perchet
Multiplayer bandits have recently been extensively studied because of their application to cognitive radio networks. While the literature mostly considers synchronous players, radi…
Addressing Bias in Online Selection with Limited Budget of Comparisons
Ziyad Benomar, Evgenii Chzhen, Nicolas Schreuder +1
Consider a hiring process with candidates coming from different universities. It is easy to order candidates with the same background, yet it can be challenging to compare them oth…