DeepAI AI Chat
Log In Sign Up

Two-Sided Random Matching Markets: Ex-Ante Equivalence of the Deferred Acceptance Procedures

by   Simon Mauras, et al.

Stable matching in a community consisting of N men and N women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley. When the input preference profile is generated from a distribution, we study the output distribution of two stable matching procedures: women-proposing-deferred-acceptance and men-proposing-deferred-acceptance. We show that the two procedures are ex-ante equivalent: that is, under certain conditions on the input distribution, their output distributions are identical. In terms of technical contributions, we generalize (to the non-uniform case) an integral formula, due to Knuth and Pittel, which gives the probability that a fixed matching is stable. Using an inclusion-exclusion principle on the set of rotations, we give a new formula which gives the probability that a fixed matching is the women/men-optimal stable matching. We show that those two probabilities are equal with an integration by substitution.


page 1

page 2

page 3

page 4


On popularity-based random matching markets

Stable matching in a community consisting of N men and N women is a clas...

Accomplice Manipulation of the Deferred Acceptance Algorithm

The deferred acceptance algorithm is an elegant solution to the stable m...

NC Algorithms for Popular Matchings in One-Sided Preference Systems and Related Problems

The popular matching problem is of matching a set of applicants to a set...

Limited Farsightedness in Priority-Based Matching

We consider priority-based matching problems with limited farsightedness...

Adapting Stable Matchings to Evolving Preferences

Adaptivity to changing environments and constraints is key to success in...

Stable Matching Games

In 1962, Gale and Shapley introduced a matching problem between two sets...

A Continuum Model of Stable Matching With Finite Capacities

This paper introduces a unified framework for stable matching, which nes...