Abstract:
This paper considers a matchmaker game in the Shapley-Shubik (1971) (one-to-one) assignment problem. Each firm proposes how much it is willing to pay each worker if they are matched. Each worker also proposes which salary she is willing to accept from each firm if they are matched. The matchmaker chooses a matching to maximize profit (the sum of the difference between the offering and asking salaries from each matched firm-worker). First, we show that Nash equilibrium may generate inefficient outcomes, but the matchmaker's profit is always zero in every Nash equilibrium. Second, we show that the sets of stable assignments and strong Nash equilibria are equivalent. These results extend to the Kelso-Crawford (1982) many-to-one assignment problem. Interestingly, in the one-to-one matching case, our results are closely related to the common agency game by Bernheim and Whinston (1986), while in the many-to-one assignment problem, such relationships break down completely.
More papers in Boston College Working Papers in Economics from Boston College Department of Economics Address: Boston College, 140 Commonwealth Avenue, Chestnut Hill MA 02467 USA Contact information at EDIRC. Series data maintained by Christopher F Baum ().
This site is part of RePEc
and all the data displayed here is part of the RePEc data set.
Is your work missing from RePEc? Here is how to
contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .