1 citations · 1 across the 5 of their papers we have counts for
8 papers
Linear Extensions of Rotor-Routing in Directed Graphs: Reachability Problems
David Auger, Pierre Coucheney, Kossi Roland Etse
We develop a unified framework for rotor-routing that extends the classical model to a broad class of multigraphs equipped with Generalized Rotor Mechanisms (GRM). This perspective…
Generalized ARRIVAL Problem for Rotor Walks in Path Multigraphs
David Auger, Pierre Coucheney, Loric Duhazé +1
Rotor walks are cellular automata that determine deterministic traversals of particles in a directed multigraph using simple local rules, yet they can generate complex behaviors. F…
Polynomial Time Algorithm for ARRIVAL on Tree-like Multigraphs
David Auger, Pierre Coucheney, Loric Duhaze
A rotor walk in a directed graph can be thought of as a deterministic version of a Markov Chain, where a pebble moves from vertex to vertex following a simple rule until a terminal…
Solving Simple Stochastic Games with few Random Nodes faster using Bland's Rule
David Auger, Pierre Coucheney, Yann Strozecki
The best algorithm so far for solving Simple Stochastic Games is Ludwig's randomized algorithm which works in expected time. We first give a simpler iterative var…
Optimal Distributed Channel Assignment in D2D Networks Using Learning in Noisy Potential Games
Mohd. Shabbir Ali, Pierre Coucheney, Marceau Coupechoux
We present a novel solution for Channel Assignment Problem (CAP) in Device-to-Device (D2D) wireless networks that takes into account the throughput estimation noise. CAP is known t…
Finding Optimal Strategies of Almost Acyclic Simple Stochatic Games
David Auger, Pierre COUCHENEY, Yann Strozecki
The optimal value computation for turned-based stochastic games with reachability objectives, also known as simple stochastic games, is one of the few problems in wh…
Penalty-regulated dynamics and robust learning procedures in games
Pierre Coucheney, Bruno Gaujal, Panayotis Mertikopoulos
Starting from a heuristic learning scheme for N-person games, we derive a new class of continuous-time learning dynamics consisting of a replicator-like drift adjusted by a penalty…
A Distributed Algorithm for Fair and Efficient User-Network Association in Multi-Technology Wireless Networks
Pierre Coucheney, Corinne Touati, Bruno Gaujal
Recent mobile equipment (as well as the norm IEEE 802.21) now offers the possibility for users to switch from one technology to another (vertical handover). This allows flexibility…