DeepAI AI Chat
Log In Sign Up

On Clearing Prices in Matching Markets: A Simple Characterization without Duality

12/02/2019
by   Xiaoming Li, et al.
Peking University
0

Duality of linear programming is a standard approach to the classical weighted maximum matching problem. From an economic perspective, the dual variables can be regarded as prices of products and payoffs of buyers in a two-sided matching market. Traditional duality-based algorithms, e.g., Hungarian, essentially aims at finding a set of prices that clears the market. Under such market-clearing prices, a maximum matching is formed when buyers buy their most preferred products respectively. We study the property of market-clearing prices without the use of duality, showing that: (1) the space of market-clearing prices is convex and closed under element-wise maximum and minimum operations; (2) any market-clearing prices induce all maximum matchings.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/30/2021

Matching Markets

Matching markets are of particular interest in computer science and econ...
04/18/2018

An Economic-Based Analysis of RANKING for Online Bipartite Matching

We give a simple proof showing that the RANKING algorithm introduced by ...
04/07/2020

The Economics of Social Data

A data intermediary pays consumers for information about their preferenc...
03/30/2021

Reputation and Pricing Dynamics in Online Markets

We study the economic interactions among sellers and buyers in online ma...
11/01/2022

Simplified Prophet Inequalities for Combinatorial Auctions

We consider prophet inequalities for XOS and MPH-k combinatorial auction...
07/04/2019

Optimal transport on large networks a practitioner guide

This article presents a set of tools for the modeling of a spatial alloc...