A note on the efficiency and fairness of decentralized matching

A note on the efficiency and fairness of decentralized matching

0.00 Avg rating0 Votes
Article ID: iaor20117394
Volume: 39
Issue: 4
Start Page Number: 231
End Page Number: 233
Publication Date: Jul 2011
Journal: Operations Research Letters
Authors:
Keywords: simulation: applications
Abstract:

This note shows by means of simulation experiments that although two‐sided matching markets can always converge to a stable outcome via a decentralized process of matching and rematching, the most likely outcome need not be the median matching or a minimum‐choice‐count matching, whether or not the two coincide.

Reviews

Required fields are marked *. Your email address will not be published.