1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.GT2022
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…
cs.DS2019
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…
cs.GT2008★ 1 cited
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…