Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation
Near-Optimal Dynamic Matching via Coarsening with Application to Heart Transplantation explores Develops an innovative coarsening-based algorithm for online matching with applications in heart transplantation allocation.. Commercial viability score: 5/10 in Medical AI.
BUILDER'S SANDBOX
Build This Paper
Use an AI coding agent to implement this research.
OpenAI CodexAI Agent
Lightweight coding agent in your terminal.
Claude CodeAI Agent
Agentic coding tool for terminal workflows.
AntiGravity IDEScaffolding
AI agent mindset installer and workflow scaffolder.
CursorIDE
AI-first code editor built on VS Code.
VS CodeIDE
Free, open-source editor by Microsoft.
Recommended Stack
Startup Essentials
Estimated $9K - $13K over 6-10 weeks.
See exactly what it costs to build this -- with 3 comparable funded startups.
7-day free trial. Cancel anytime.
Discover the researchers behind this paper and find similar experts.
7-day free trial. Cancel anytime.
Related Papers
- Builds On ThisBandit Learning in Matching Markets with InterviewsViability: 3.0
- Builds On ThisLearning-Augmented Algorithms for $k$-median via Online LearningViability: 3.0
- Builds On ThisRegret Bounds for Competitive Resource Allocation with Endogenous CostsViability: 3.0
- Prior WorkDivide and Learn: Multi-Objective Combinatorial Optimization at ScaleViability: 5.0
- Prior WorkLearning Optimal and Sample-Efficient Decision Policies with GuaranteesViability: 5.0