no code implementations • 1 Jun 2022 • Geovani Rizk, Igor Colin, Albert Thomas, Rida Laraki, Yann Chevaleyre
We propose the first regret-based approach to the Graphical Bilinear Bandits problem, where $n$ agents in a graph play a stochastic bilinear bandit game with each of their neighbors.
no code implementations • 10 Aug 2021 • Rida Laraki, Estelle Varloot
In the problem of aggregating experts' probabilistic predictions over an ordered set of outcomes, we introduce the axiom of level-strategy\-proofness (level-SP) and prove that it is a natural notion with several applications.
no code implementations • 4 Jul 2021 • Saeed Hadikhanloo, Rida Laraki, Panayotis Mertikopoulos, Sylvain Sorin
We examine the long-run behavior of a wide range of dynamics for learning in nonatomic games, in both discrete and continuous time.
no code implementations • 23 Feb 2021 • Andrew Jennings, Rida Laraki, Clemens Puppe, Estelle Varloot
We provide novel simple representations of strategy-proof voting rules when voters have uni-dimensional single-peaked preferences (as well as multi-dimensional separable preferences).
Computer Science and Game Theory Theoretical Economics
no code implementations • 14 Dec 2020 • Geovani Rizk, Albert Thomas, Igor Colin, Rida Laraki, Yann Chevaleyre
We study the best arm identification problem in which the learner wants to find the graph allocation maximizing the sum of the bilinear rewards.
no code implementations • 28 May 2020 • Srihari Govindan, Rida Laraki, Lucas Pahl
Following the ideas laid out in Myerson (1996), Hofbauer (2000) defined a Nash equilibrium of a finite game as sustainable if it can be made the unique Nash equilibrium of a game obtained by deleting/adding a subset of the strategies that are inferior replies to it.
no code implementations • 14 May 2019 • Eric Benhamou, Jamal Atif, Rida Laraki, David Saltiel
This paper deals with estimating model parameters in graphical models.
no code implementations • 27 Dec 2018 • Eric Benhamou, Jamal Atif, Rida Laraki
This allows creating a version of CMA ES that can accommodate efficiently discrete variables.
no code implementations • 28 Sep 2016 • János Flesch, Rida Laraki, Vianney Perchet
The third is necessary: if it is not satisfied, the opponent can weakly exclude the target set.
