Byzantine Stable Matching
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 they want to be matched with. Moreover a matching is said to be stable if no pair of agents prefer each other over their current matching.
Authors
- Diana Ghinea (ORCID: https://orcid.org/0000-0002-5294-9459)
- Roger Wattenhofer (ORCID: https://orcid.org/0000-0002-6339-3134)
- Andrei Constantinescu (ORCID: https://orcid.org/0009-0005-1708-9376)
- Marc Dufay
Institutions
- ETH Zurich (CH)
- Lucerne University of Applied Sciences and Arts (CH)
Publication Details
- Published
- 2025-06-13
- DOI
- https://doi.org/10.1145/3732772.3733525
- Citations
- 1
- Primary Topic
- Game Theory and Voting Systems
- Type
- article
- Field-Weighted Citation Impact
- 3.13