This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
This post collects a few papers on dynamic matching. Gupta gives a sum-of-squares greedy algorithm for multiway matching with bounded regret (Gupta 2024). Wei, Xu, and Yu propose a primal-dual policy for multi-way dynamic matching (Wei, Xu, and Yu 2023). Dynamic Matching Without Departures Kerimov, Ashlagi, and Gurvich have two papers which consider a very similar model, in which agents do not…
This post collects a few papers on dynamic matching.
Gupta gives a sum-of-squares greedy algorithm for multiway matching with bounded regret (Gupta 2024).
Wei, Xu, and Yu propose a primal-dual policy for multi-way dynamic matching (Wei, Xu, and Yu 2023).
Dynamic Matching Without Departures Kerimov, Ashlagi, and Gurvich have two papers which consider a very similar model, in which agents do not depart.
TODO: describe the model.
The first of these, Kerimov, Ashlagi, and Gurvich (2023), published in Management Science, considers a model in which some matches can involve more than two agents.Read on /futureposts/dynamicmatchingsurvey/ ↗
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.