Designing Approximately Optimal Search on Matching Platforms

02/17/2021
by   Nicole Immorlica, et al.
0

We study the design of a decentralized two-sided matching market in which agents' search is guided by the platform. There are finitely many agent types, each with (potentially random) preferences drawn from known type-specific distributions. Equipped with such distributional knowledge, the platform guides the search process by determining the meeting rate between each pair of types from the two sides. Focusing on symmetric pairwise preferences in a continuum model, we first characterize the unique stationary equilibrium that arises given a feasible set of meeting rates. We then introduce the platform's optimal directed search problem, which involves optimizing meeting rates to maximize equilibrium social welfare. We first show that incentive issues arising from congestion and cannibalization makes the design problem fairly intricate. Nonetheless, we develop an efficiently computable solution whose corresponding equilibrium achieves at least 1/4 of the optimal social welfare. Our directed search design is simple and easy-to-implement, as its corresponding bipartite graph consists of disjoint stars. Furthermore, our solution implies that the platform can substantially limit choice and yet induce an equilibrium with an approximately optimal welfare. Finally, we show that approximation is the likely best we can hope by establishing that the problem of designing optimal directed search is NP-hard to approximate beyond a certain constant factor.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/16/2023

Welfare Distribution in Two-sided Random Matching Markets

We study the welfare structure in two-sided large random matching market...
research
12/05/2018

Peer-to-Peer Electricity Market Analysis: From Variational to Generalized Nash Equilibrium

We consider a network of prosumers involved in peer-to-peer energy excha...
research
09/15/2023

Platform Equilibrium: Analayzing Social Welfare in Online Market Places

We introduce the theoretical study of a Platform Equilibrium. There are ...
research
03/18/2021

Search and Matching for Adoption from Foster Care

More than 100,000 children in the US foster care system are currently wa...
research
11/07/2022

Approximating Nash Social Welfare by Matching and Local Search

For any ε>0, we give a simple, deterministic (6+ε)-approximation algorit...
research
10/24/2020

Mechanism Design for Stable Matching with Contracts in a Dynamic Manufacturing-as-a-Service (MaaS) Marketplace

Two-sided manufacturing-as-a-service (MaaS) marketplaces connect clients...
research
12/28/2017

Game-Theoretic Design of Optimal Two-Sided Rating Protocols for Service Exchange Dilemma in Crowdsourcing

Despite the increasing popularity and successful examples of crowdsourci...

Please sign up or login with your details

Forgot password? Click here to reset