Assortment Optimization for Patient-Provider Matching
Naveen Raman, Holly Wiberg

TL;DR
This paper introduces a novel assortment optimization approach for patient-provider matching that improves match quality by offering tailored provider menus, balancing patient choice and system efficiency in healthcare settings.
Contribution
It formulates a new variant of assortment optimization for healthcare, proposing policies that enhance match quality and system performance based on patient and provider data.
Findings
Best policy varies with problem specifics.
Proposed policy improves match quality by 13%.
Tradeoff identified between menu size and match quality.
Abstract
Rising provider turnover results in frequently needing to rematch patients with available providers. However, the rematching process is cumbersome for both patients and health systems, resulting in labor-intensive and ad hoc reassignments. We propose a novel patient-provider matching approach to address this issue by offering patients limited provider menus. The goal is to maximize match quality across the system while preserving patient choice. We frame this as a novel variant of assortment optimization, where patient-specific provider menus are offered upfront, and patients respond in a random sequence to make their selections. This hybrid offline-online setting is understudied in previous literature and captures system dynamics across various domains. We first demonstrate that a greedy baseline policy--which offers all providers to all patients--can maximize the match rate but lead…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsHealthcare Operations and Scheduling Optimization · Healthcare Policy and Management
MethodsHigh-Order Consensuses · Sparse Evolutionary Training
