approximation algorithms 1computational complexity 1graph design 1pairwise stability 1stable matching 1
From the 1 of 7 linked papers with an AI index.
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2026
Designing Pairwise-Stable Agent Seating Arrangements
Frederik Glitzner
The paper studies how a central planner can design the underlying graph on which agents with ordinal preferences are seated, aiming to achieve pairwise‑stable arrangements while ba…
cs.DS2025
Unsolvability and Beyond in Many-To-Many Non-Bipartite Stable Matching
Frederik Glitzner, David Manlove
We study the Stable Fixtures problem, a many-to-many generalisation of the classical non-bipartite Stable Roommates matching problem. Building on the foundational work of Tan on st…
cs.DS2024
Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem
Frederik Glitzner, David Manlove
In the Stable Roommates problem, we seek a stable matching of the agents into pairs, in which no two agents have an incentive to deviate from their assignment. It is well known tha…