Research map / Bandits and online learning / Online convex optimization and games
Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation
Itai Zilberstein, Ioannis Anagnostides, Zachary W. Sollie, Arman Kilic, Tuomas Sandholm
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 |
|---|---|---|---|
| cluster patients into capacitated clusters of minimum size b instead of individual nodes (b=1) (ablation) | online stochastic matching for heart allocation · UNOS simulation, Jan-Jun 2019 | competitive ratio: 0.63 -> 0.91 | Improved |
| use coarsening-based policy instead of US status quo allocation | heart transplant allocation · UNOS simulation, Jan-Jun 2019 | competitive ratio: 0.51 -> 0.91 | Improved |
| change the clustering algorithm (agglomerative, constrained k-means, recursive bisection) (ablation) | clustered stochastic matching · UNOS simulation | competitive ratio | No clear effect |
| use very large cluster size b (ablation) | clustered stochastic matching · UNOS simulation | competitive ratio | Hurt |
| use greedy intra-cluster patient selection instead of uniform random (ablation) | clustered stochastic matching · UNOS simulation | competitive ratio | Improved |
| cluster offline nodes into capacitated clusters | planning LP · UNOS simulation | run time | Improved |
Closest papers by meaning
- Generalized Stochastic Matching (AAAI 2022 · similarity 0.85)
- Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy (ICML 2018 · similarity 0.85)
- Promoting Fairness Among Dynamic Agents in Online-Matching Markets under Known Stationary Arrival Distributions (NeurIPS 2024 · similarity 0.85)
- Online Matching in Sparse Random Graphs: Non-Asymptotic Performances of Greedy Algorithm (NeurIPS 2021 · similarity 0.85)
- DiMa: Understanding the Hardness of Online Matching Problems via Diffusion Models (ICML 2025 · similarity 0.84)
- Stochastic Matching via Local Sparsification (NeurIPS 2026 · 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.
