AI Paper Atlas

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

ICML 2026 · Bandits and online learning › Online convex optimization and games · approach: Learning-augmented online algorithms · 0 citations (OpenAlex)

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 changedWhereMeasuredEffect
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 2019competitive ratio: 0.63 -> 0.91Improved
use coarsening-based policy instead of US status quo allocationheart transplant allocation · UNOS simulation, Jan-Jun 2019competitive ratio: 0.51 -> 0.91Improved
change the clustering algorithm (agglomerative, constrained k-means, recursive bisection) (ablation)clustered stochastic matching · UNOS simulationcompetitive ratioNo clear effect
use very large cluster size b (ablation)clustered stochastic matching · UNOS simulationcompetitive ratioHurt
use greedy intra-cluster patient selection instead of uniform random (ablation)clustered stochastic matching · UNOS simulationcompetitive ratioImproved
cluster offline nodes into capacitated clustersplanning LP · UNOS simulationrun timeImproved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy