Approximately Stable Matchings With Budget Constraints

Authors

  • Yasushi Kawase Tokyo Institute of Technology; RIKEN AIP Center
  • Atsushi Iwasaki University of Electro-Communications; RIKEN AIP Center

Keywords:

Game theory, Mechanism design, Two-sided matching, Budget constraints

Abstract

This paper examines two-sided matching with budget constraints where one side (a firm or hospital) can make monetary transfers (offer wages) to the other (a worker or doctor). In a standard model, while multiple doctors can be matched to a single hospital, a hospital has a maximum quota; thus, the number of doctors assigned to a hospital cannot exceed a certain limit. In our model, in contrast, a hospital has a fixed budget; that is, the total amount of wages allocated by each hospital to doctors is constrained. With budget constraints, stable matchings may fail to exist and checking for the existence is hard. To deal with the nonexistence of stable matchings, we extend the "matching with contracts" model of Hatfield and Milgrom so that it deals with approximately stable matchings where each of the hospitals' utilities after deviation can increase by a factor up to a certain amount. We then propose two novel mechanisms that efficiently return a stable matching that exactly satisfies the budget constraints. Specifically, by sacrificing strategy-proofness, our first mechanism achieves the best possible bound. We also explore a special case on which a simple mechanism is strategy-proof for doctors, while maintaining the best possible bound of the general case.

Downloads

Published

2018-04-25

How to Cite

Kawase, Y., & Iwasaki, A. (2018). Approximately Stable Matchings With Budget Constraints. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/11470

Issue

Section

AAAI Technical Track: Game Theory and Economic Paradigms