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 …

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 …

One of the most promising approaches to overcoming the uncertainty of millimeter wave
(mm-wave) communications is to deploy dual-mode small base stations (SBSs) that …

Distributional constraints are important in many market design settings. Prominent examples
include the minimum manning requirements at each Army branch in military cadet matching …

We study dynamic matching in an infinite-horizon stochastic market. Although all agents are
potentially compatible with each other, some are hard to match and others are easy to …

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) …

We consider the problem faced by a service platform that needs to match limited supply with
demand while learning the attributes of new users to match them better in the future. We …

This paper develops a novel parking navigation system for downtown parking that aims to
mitigate parking competition by guiding drivers to appropriate vacant parking spaces. Given …

Istudydynamicmatchingmarketswherematch…, andmatching is one-to-one and irreversible.
The proposed stability notion, dynamic stability, incorporates a backward induction notion to …

We consider the problem faced by a service platform that needs to match limited supply with
demand but also to learn the attributes of new users in order to match them better in the …