Matching markets with middlemen under transferable utility

09/12/2021
by   Ata Atay, et al.
0

This paper studies matching markets in the presence of middlemen. In our framework, a buyer-seller pair may either trade directly or use the services of a middleman; and a middleman may serve multiple buyer-seller pairs. Direct trade between a buyer and a seller is costlier than a trade mediated by a middleman. For each such market, we examine an associated cooperative game with transferable utility. First, we show that an optimal matching for a matching market with middlemen can be obtained by considering the two-sided assignment market where each buyer-seller pair is allowed to use the mediation service of the middlemen free of charge and attain the maximum surplus. Second, we prove that the core of a matching market with middlemen is always non-empty. Third, we show the existence of a buyer-optimal core allocation and a seller-optimal core allocation. In general, the core does not exhibit a middleman-optimal matching. Finally, we establish the coincidence between the core and the set of competitive equilibrium payoff vectors.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2023

Graphical One-Sided Markets with Exchange Costs

This paper proposes a new one-sided matching market model in which every...
research
12/12/2016

An Optimization Framework For Online Ride-sharing Markets

Taxi services and product delivery services are instrumental for our mod...
research
01/02/2020

Quick or cheap? Breaking points in dynamic markets

We examine two-sided markets where players arrive stochastically over ti...
research
10/13/2021

The core of housing markets from an agent's perspective: Is it worth sprucing up your home?

We study housing markets as introduced by Shapley and Scarf (1974). We i...
research
01/30/2021

Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange

In a housing market of Shapley and Scarf, each agent is endowed with one...
research
03/24/2023

Dynamic Combinatorial Assignment

We study a model of dynamic combinatorial assignment of indivisible obje...
research
09/15/2022

Exploring the Tradeoff between Competitive Ratio and Variance in Online-Matching Markets

In this paper, we propose an online-matching-based model to study the as...

Please sign up or login with your details

Forgot password? Click here to reset