Arrow Research search
Back to JAAMAS

JAAMAS 2011

Anarchy, stability, and utopia: creating better matchings

Journal Article OriginalPaper Artificial Intelligence ยท Multi-Agent Systems

Abstract

Abstract Historically, the analysis of matching has centered on designing algorithms to produce stable matchings as well as on analyzing the incentive compatibility of matching mechanisms. Less attention has been paid to questions related to the social welfare of stable matchings in cardinal utility models. We examine the loss in social welfare that arises from requiring matchings to be stable, the natural equilibrium concept under individual rationality. While this loss can be arbitrarily bad under general preferences, when there is some structure to the underlying graph corresponding to natural conditions on preferences, we prove worst case bounds on the price of anarchy. Surprisingly, under simple distributions of utilities, the average case loss turns out to be significantly smaller than the worst-case analysis would suggest. Furthermore, we derive conditions for the existence of approximately stable matchings that are also close to socially optimal, demonstrating that adding small switching costs can make socially (near-)optimal matchings stable. Our analysis leads to several concomitant results of interest on the convergence of decentralized partner-switching algorithms, and on the impact of heterogeneity of tastes on social welfare.

Authors

Keywords

  • Stable matching
  • Price of anarchy
  • Price of stability
  • Approximate equilibrium

Context

Venue
Autonomous Agents and Multi-Agent Systems
Archive span
2005-2026
Indexed papers
940
Paper id
1052030884319786870
v2026.09.13