Edge Weighted Online Windowed Matching
Motivated by applications from ride-sharing and kidney exchange, we study the problem of matching agents who arrive at a marketplace over time and leave after d time periods. Agents can only be matched while they are present in the marketplace. Each pair of agents can yield a different match value,...
Main Authors: | Burq, Maximilien, Jaillet, Patrick |
---|---|
Other Authors: | Sloan School of Management |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM)
2021
|
Online Access: | https://hdl.handle.net/1721.1/129356 |
Similar Items
-
On Matching and Thickness in Heterogeneous Dynamic Markets
by: Burq, Maximilien, et al.
Published: (2021) -
Dynamic matching algorithms
by: Burq, Maximilien.
Published: (2019) -
An HMM-based map matching method with cumulative proximity-weight formulation
by: Oran, Ali, et al.
Published: (2015) -
Online Stochastic Matching: New Algorithms with Better Bounds
by: Jaillet, Patrick, et al.
Published: (2015) -
Online spatio-Temporal matching in stochastic and dynamic domains
by: Lowalekar, Meghna, et al.
Published: (2018)