3 papers
cs.DS2025
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…
cs.DC2025
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…
cs.DC2024
Validity in Network-Agnostic Byzantine Agreement
Andrei Constantinescu, Marc Dufay, Diana Ghinea +1
Byzantine Agreement (BA) considers a setting of parties, out of which up to can exhibit byzantine (malicious) behavior. Honest parties must decide on a common value (agreem…