Research map / Learning theory and algorithms / Combinatorial and search optimization
Equitable Stable Matchings in Quadratic Time
Nikolaos Tziavelis, Ioannis Giannakopoulos, Katerina Doka, Nectarios Koziris, Panagiotis Karras
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 |
|---|---|---|---|
| Add random moves with probability p about 0.125 to rotation-based local search (ablation) | iBILS · Discrete data (3 sizes, 2000 instances per size) | sex-equality cost | Improved |
| Add random moves (p > 0) to breakmarriage-based local search (ablation) | BILS · Uniform, Discrete, Gaussian data | sex-equality cost | Hurt |
| Replace breakmarriage operations with fine-grained rotations in lattice local search (iBILS vs BILS) | BILS · Synthetic U, D, G (Figures 1, 2) | runtime and cost | Improved |
| Start local search from the PowerBalance output instead of an extreme lattice position (Hybrid vs BILS) | local search · Synthetic data up to n=4000 | runtime scalability | Improved |
| Add local search after PowerBalance (Hybrid, HMS vs PowerBalance alone) | PowerBalance · Synthetic data up to n=4000 | balance and sex-equality cost | Improved |
| Use multiple evenly placed PowerBalance termination points as local search starts (HMS vs Hybrid) | Hybrid · Discrete data (Figure 1f) | sex-equality cost | Improved |
| Use SDA-based PowerBalance instead of DACC with the same proposal strategy | proposal-based methods · Synthetic data, both cost metrics | balance and sex-equality cost | Improved |
| Use iBILS/HMS instead of APPROX | APPROX · Uniform and Gaussian, n=4000 | SEq ratio over DA | Improved |
| Use APPROX instead of iBILS on Discrete data | iBILS · Discrete, n=4000 | SEq ratio over DA | Hurt |
| Use any heuristic versus the one-side-biased solution on UniformDiscrete data | all algorithms · UniformDiscrete (Figures 1d, 1h, 3d) | balance and SEq | No clear effect |
| Set PowerBalance round limit to Theta(n log2 n) rounds (ablation) | PowerBalance · 100 instances per size | sex-equality cost | Improved |
Closest papers by meaning
- Stable Matching with Ties: Approximation Ratios and Learning (NeurIPS 2025 · similarity 0.85)
- Putting Gale & Shapley to Work: Guaranteeing Stability Through Learning (NeurIPS 2024 · similarity 0.84)
- 1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations (AAAI 2024 · similarity 0.83)
- Decentralized and Uncoordinated Learning of Stable Matchings: A Game-Theoretic Approach (AAAI 2025 · similarity 0.83)
- Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously (AAAI 2025 · similarity 0.83)
- Improved Bandits in Many-to-One Matching Markets with Incentive Compatibility (AAAI 2024 · similarity 0.83)
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.
