Matching in Dynamic Imbalanced Markets
We study dynamic matching in exchange markets with easy- and hard-to-match agents. A greedy policy, which attempts to match agents upon arrival, ignores the positive externality that waiting agents generate by facilitating future matchings. We prove that this trade-off between a ``thicker'' market and faster matching vanishes in large markets; A greedy policy leads to shorter waiting times, and more agents matched than any other policy. We empirically confirm these findings in data from the National Kidney Registry. Greedy matching achieves as many transplants as commonly-used policies (1.6\% more than monthly-batching), and shorter patient waiting times.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Dynamically Stable Matching
I introduce a stability notion, dynamic stability, for two-sided dynamic matching markets where (i) matching opportunities arrive over time, (ii) matching is one-to-one, and (iii) matching is irreversible. The definition…
BlockingFormConsistent Conjectures in Dynamic Matching Markets
We provide a framework to study stability notions for two-sided dynamic matching markets in which matching is one-to-one and irreversible. The framework gives center stage to the set of matchings an agent anticipates wou…
Stability in Repeated Matching Markets
This paper develops a framework for repeated matching markets. The model departs from the Gale-Shapley matching model by having a fixed set of long-lived hospitals match with a new generation of short-lived residents in …
Self-Enforced Job Matching
The classic two-sided many-to-one job matching model assumes that firms treat workers as substitutes and workers ignore colleagues when choosing where to work. Relaxing these assumptions may lead to nonexistence of stabl…
Dynamic Matching Markets in Power Grid: Concepts and Solution using Deep Reinforcement Learning
Traditional bulk load flexibility options, such as load shifting and load curtailment, for managing uncertainty in power markets limit the diversity of options and ignore the preferences of the individual loads, thus red…
Deep Reinforcement LearningDiversityreinforcement-learningReinforcement Learning (RL)