Research map / Learning theory and algorithms / Submodular and game algorithms
Fast Optimal Clearing of Capped-Chain Barter Exchanges
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (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 |
|---|---|---|---|
| use corrected polynomial-time pricing with loop prevention (BNP-POLY) instead of exhaustive DFS pricing | branch-and-price kidney exchange solver · UNOS match runs | runtime | Helped |
| use BNP-POLY instead of constraint-generation CG-TSP | kidney exchange solver · generated UNOS data, finite chain cap | runtime/timeouts | Helped |
| use CG-TSP instead of branch and price with no chain cap | kidney exchange solver · generated UNOS data, no chain cap | runtime | Hurt |
| raise the chain-length cap | kidney exchange solvers · generated UNOS data | runtime | Hurt |
Closest papers by meaning
- Improving Policy-Constrained Kidney Exchange via Pre-Screening (NeurIPS 2020 · similarity 0.94)
- Scalable Robust Kidney Exchange (AAAI 2019 · similarity 0.92)
- Small Representations of Big Kidney Exchange Graphs (AAAI 2017 · similarity 0.90)
- Stable Matchings in Practice: A Constraint Programming Approach (AAAI 2024 · similarity 0.80)
- Stable Matching with Ties: Approximation Ratios and Learning (NeurIPS 2025 · similarity 0.80)
- Learning to Build Solutions in Stochastic Matching Problems Using Flows (Student Abstract) (AAAI 2024 · similarity 0.79)
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.