Quick or cheap? Breaking points in dynamic markets

01/02/2020
by   Panayotis Mertikopoulos, et al.
0

We examine two-sided markets where players arrive stochastically over time and are drawn from a continuum of types. The cost of matching a client and provider varies, so a social planner is faced with two contending objectives: a) to reduce players' waiting time before getting matched; and b) to form efficient pairs in order to reduce matching costs. We show that such markets are characterized by a quick-or-cheap dilemma: Under a large class of distributional assumptions, there is no 'free lunch', i.e., there exists no clearing schedule that is simultaneously optimal along both objectives. We further identify a unique breaking point signifying a stark reduction in matching cost contrasted by an increase in waiting time. Generalizing this model, we identify two regimes: one, where no free lunch exists; the other, where a window of opportunity opens to achieve a free lunch. Remarkably, greedy scheduling is never optimal in this setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2021

Multi-Sided Matching Markets with Consistent Preferences and Cooperative Partners

We introduce a variant of the three-sided stable matching problem for a ...
research
09/12/2021

Matching markets with middlemen under transferable utility

This paper studies matching markets in the presence of middlemen. In our...
research
01/28/2021

Two-Sided Matching Markets in the ELLIS 2020 PhD Program

The ELLIS PhD program is a European initiative that supports excellent y...
research
06/12/2019

Competing Bandits in Matching Markets

Stable matching, a classical model for two-sided markets, has long been ...
research
05/22/2019

Approximately Maximizing the Broker's Profit in a Two-sided Market

We study how to maximize the broker's (expected) profit in a two-sided m...
research
10/29/2020

Learning Strategies in Decentralized Matching Markets under Uncertain Preferences

We study two-sided decentralized matching markets in which participants ...
research
03/02/2017

Adaptive Matching for Expert Systems with Uncertain Task Types

Online two-sided matching markets such as Q&A forums (e.g. StackOverflow...

Please sign up or login with your details

Forgot password? Click here to reset