Search Results for author: Rida Laraki

Found 9 papers, 0 papers with code

An $α$-No-Regret Algorithm For Graphical Bilinear Bandits

no code implementations1 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.

Level-strategyproof Belief Aggregation Mechanisms

no code implementations10 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.

Learning in nonatomic games, Part I: Finite action spaces and population games

no code implementations4 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.

New Characterizations of Strategy-Proofness under Single-Peakedness

no code implementations23 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

Best Arm Identification in Graphical Bilinear Bandits

no code implementations14 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.

On Sustainable Equilibria

no code implementations28 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.

NGO-GM: Natural Gradient Optimization for Graphical Models

no code implementations14 May 2019 Eric Benhamou, Jamal Atif, Rida Laraki, David Saltiel

This paper deals with estimating model parameters in graphical models.

A discrete version of CMA-ES

no code implementations27 Dec 2018 Eric Benhamou, Jamal Atif, Rida Laraki

This allows creating a version of CMA ES that can accommodate efficiently discrete variables.

Approachability of convex sets in generalized quitting games

no code implementations28 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.

Cannot find the paper you are looking for? You can Submit a new open access paper.