79 citations · 90 across the 7 of their papers we have counts for
8 papers
Solving Random Parity Games in Polynomial Time
Richard Combes, Mikael Touati
We consider the problem of solving random parity games. We prove that parity games exibit a phase transition threshold above , so that when the degree of the graph that define…
Solving Bernoulli Rank-One Bandits with Unimodal Thompson Sampling
Cindy Trinh, Emilie Kaufmann, Claire Vernade +1
Stochastic Rank-One Bandits (Katarya et al, (2017a,b)) are a simple framework for regret minimization problems over rank-one matrices of arms. The initially proposed algorithms are…
Device-to-Device Aided Multicasting
Thomas Varela Santana, Richard Combes, Mari Kobayashi
We consider a device-to-device (D2D) aided multicast channel, where a transmitter wishes to convey a common message to many receivers and these receivers cooperate with each other.…
Utility Optimal Scheduling for Coded Caching in General Topologies
Richard Combes, Asma Ghorbel, Mari Kobayashi +1
We consider coded caching over the fading broadcast channel, where the users, equipped with a memory of finite size, experience asymmetric fading statistics. It is known that a nai…
Minimal Exploration in Structured Stochastic Bandits
Richard Combes, Stefan Magureanu, Alexandre Proutiere
This paper introduces and addresses a wide class of stochastic bandit problems where the function mapping the arm to the corresponding reward exhibits some known structural propert…
An Approximate ML Detector for MIMO Channels Corrupted by Phase Noise
Richard Combes, Sheng Yang
We consider the multiple-input multiple-output (MIMO) communication channel impaired by phase noises at both the transmitter and receiver. We focus on the maximum likelihood (ML) d…