We introduce a simple model of dynamic matching in networked markets, where agents
arrive and depart stochastically and the composition of the trade network depends …

Problem definition: Recently, there has been a rapid rise of on-demand ride-hailing
platforms, such as Uber and Didi, which allow passengers with smartphones to submit trip …

Bipartite-matching markets pair agents on one side of a market with agents, items, or
contracts on the opposing side. Prior work addresses online bipartite-matching markets …

We study a dynamic matching environment where individuals arrive sequentially. There is a
trade‐off between waiting for a thicker market, allowing for higher‐quality matches, and …

Most algorithmic matches in fielded kidney exchanges do not result in an actual transplant.
In this paper, we address the problem of cycles and chains in a proposed match failing after …

We study a Markov matching market involving a planner and a set of strategic agents on the
two sides of the market. At each step, the agents are presented with a dynamical context …

In recent years several countries have set up policies that allow exchange of kidneys
between two or more incompatible patient–donor pairs. These policies lead to what is …

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 …

Motivated by centralized matching markets, we study an online stochastic matching problem
on edge-weighted graphs, where the agents' arrivals and abandonments are stochastic and …

This paper introduces a stylized model to capture distinctive features of waiting list allocation
mechanisms. First, agents choose among items with associated expected wait times …