Matching with Couples Revisited

Details Matching with Couples Revisited Matching with Couples Revisited

2010-11-09

arxiv.org/abs/1011.2121v2

Computer Science

Computer Science and Game Theory

Scientific paper

It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a general class of large random markets the algorithm will find a stable matching with high probability. In particular we allow the number of couples to grow at a near-linear rate. Furthermore, truth-telling is an approximated equilibrium in the game induced by the new matching algorithm. Our results are tight: for markets in which the number of couples grows at a linear rate, we show that with constant probability no stable matching exists.

Affiliated with

Also associated with

No associations

Rating

Matching with Couples Revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Matching with Couples Revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Matching with Couples Revisited will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-493912