12 citations · 31 across the 24 of their papers we have counts for
7 papers · 1 filter
Polynomial self-stabilizing algorithm and proof for a 2/3-approximation of a maximum matching
Johanne Cohen, Khaled Maâmra, George Manoussakis +1
We present the first polynomial self-stabilizing algorithm for finding a -approximation of a maximum matching in a general graph. The previous best known algorithm has bee…
Self-Stabilizing Maximal Matching and Anonymous Networks
Johanne Cohen, Jonas Lefèvre, Khaled Maâmra +2
We propose a self-stabilizing algorithm for computing a maximal matching in an anonymous network. The complexity is moves with high probability, under the adversarial dist…
Exponentially fast convergence to (strict) equilibrium via hedging
Johanne Cohen, Amélie Héliou, Panayotis Mertikopoulos
Motivated by applications to data networks where fast convergence is essential, we analyze the problem of learning in generic N-person games that admit a Nash equilibrium in pure s…
Detecting service provider alliances on the choreography enactment pricing game
Johanne Cohen, Daniel Cordeiro, Loubna Echabbi
We present the choreography enactment pricing game, a cooperative game-theoretic model for the study of scheduling of jobs using competitor service providers. A choreography (a pee…
The Manne et al. self-stabilizing 2/3-approximation matching algorithm is sub-exponential
Johanne Cohen, Jonas Lefèvre, Khaled Maâmra +2
Manne et al. designed the first algorithm computing a maximal matching that is a 2/3 -approximation of the maximum matching in moves. However, the complexity tightness was…
Homonym Population Protocols
Olivier Bournez, Johanne Cohen, Mikaël Rabie
The population protocol model was introduced by Angluin \emph{et al.} as a model of passively mobile anonymous finite-state agents. This model computes a predicate on the multiset…