Research map / Learning theory and algorithms / Submodular and game algorithms
Adapting Stable Matchings to Evolving Preferences
Robert Bredereck, Jiehua Chen, Dušan Knop, Junjie Luo, Rolf Niedermeier
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Allow ties in preferences while parameterizing by matching distance k | Incremental Stable Roommates · Stable Roommates, ties allowed | parameterized complexity | Hurt |
| Allow ties in preferences while parameterizing by matching distance k | Incremental Stable Marriage · Stable Marriage, ties allowed and preference-profile swap distance 1 | parameterized complexity | Hurt |
| Parameterize no-ties Stable Roommates by the number of shared matching edges k' instead of matching distance | Incremental Stable Roommates · Stable Roommates, no ties | parameterized complexity | Hurt |
Closest papers by meaning
- MATWA: A Web Toolkit for Matching Under Preferences (AAAI 2025 · similarity 0.87)
- Strategyproof Matching of Roommates and Rooms (AAAI 2025 · similarity 0.87)
- Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning (NeurIPS 2024 · similarity 0.86)
- Matching Markets Meet LLMs: Algorithmic Reasoning with Ranked Preferences (NeurIPS 2025 · similarity 0.86)
- Stable Matching with Ties: Approximation Ratios and Learning (NeurIPS 2025 · similarity 0.85)
- Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach (AAAI 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
