1 citations · 1 across the 5 of their papers we have counts for
3 papers · 1 filter
A Deterministic Polylogarithmic Competitive Algorithm for Matching with Delays
Marc Dufay, Roger Wattenhofer
In the online Min-cost Perfect Matching with Delays (MPMD) problem, requests in a metric space are submitted at different times by an adversary. The goal is to match all reques…
From Few to Many Faults: Optimal Adaptive Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Anton Paramonov +1
Achieving agreement among distributed parties is a fundamental task in modern systems, underpinning applications such as consensus in blockchains, coordination in cloud infrastruct…
Byzantine Stable Matching
Andrei Constantinescu, Marc Dufay, Diana Ghinea +1
In stable matching, one must find a matching between two sets of agents, commonly men and women, or job applicants and job positions. Each agent has a preference ordering over who…