4 papers
A two-player version of the assignment problem
Florian Galliot, Nacim Oijid, Jonas Sénizergues
We introduce the competitive assignment problem, a two-player version of the well-known assignment problem. Given a set of tasks and a set of agents with different efficiencies for…
Maker-Maker games of rank 4 are PSPACE-complete
Florian Galliot, Jonas Sénizergues
The Maker-Maker convention of positional games is played on a hypergraph whose edges are interpreted as winning sets. Two players take turns picking a previously unpicked vertex, a…
A unified convention for achievement positional games
Florian Galliot, Jonas Sénizergues
We introduce achievement positional games, a convention for positional games which encompasses the Maker-Maker and Maker-Breaker conventions. We consider two hypergraphs, one red a…
Making Self-Stabilizing any Locally Greedy Problem
Johanne Cohen, Laurence Pilard, Mikaël Rabie +1
We propose a way to transform synchronous distributed algorithms solving locally greedy and mendable problems into self-stabilizing algorithms in anonymous networks. Mendable probl…