skip to main content
10.1145/1807342.1807361acmconferencesArticle/Chapter ViewAbstractPublication PagesecConference Proceedingsconference-collections
extended-abstract

Matching in networks with bilateral contracts: extended abstract

Published: 07 June 2010 Publication History

Abstract

We introduce a new matching model in which firms trade goods via bilateral contracts which specify a buyer, a seller, and the terms of the exchange. This framework subsumes all classical matching models, including that of Ostrovsky [5]. The generality our model affords allows us to make two substantial contributions.
First, we show that two theoretical restrictions are necessary for classical matching theory:
acyclicity - no agent may both buy from and sell to another agent, even through intermediaries, an.
full substitutability - upon being endowed with an additional item, an agent's demand for other items is lower, both in the sense of a reduced desire to buy additional items and an increased desire to sell items he currently owns.1
If either condition is violated, then existence of stable allocations cannot be guaranteed.2 Intuitively, if a contracting relationship contains a cycle, and if a firm in the cycle has an outside option which is preferred to one contract in the cycle, then both the outside option and the complete trading cycle are unstable; the necessity of acyclicity follows. The necessity of full substitutability is more technical, but follows closely upon prior results of Hatfield and Kominers [2].
Second, in the presence of acyclicity and fully substitutable preferences, we fully generalize the key results of classical matching theory. We prove that under these conditions stable allocations correspond bijectively to fixed points of an isotone operator; Tarski's fixed point theorem then guarantees the existence of a lattice of stable allocations. We also prove a generalization of the classical rural hospitals theorem of Roth [6] and the strategy-proofness results of Hatfield and Milgrom [3] and Hatfield and Kojima [1].3 These latter results display a surprising structure which can only be elicited within a framework as general as ours: in particular, we show that the difference between the numbers of buy- and sell-contracts held, rather than the absolute number of contracts held, is invariant across stable allocations for each agent.
In light of our necessity results, our work establishes a frontier of matching theory. Without acyclicity and fully substitutable preferences, stable allocations are not guaranteed to exist in general, and hence the results of classical matching theory fail. Up to the failure of these conditions, however, all of the results of classical matching theory hold.

References

[1]
Hatfield, J. W., and Kojima, F. Group incentive compatibility for matching with contracts. Games and Economic Behavior 67 (2009), 745--749.
[2]
Hatfield, J. W., and Kominers, S. D. Contract design and stability in matching with contracts. Mimeo, Stanford Graduate School of Business, 2010.
[3]
Hatfield, J. W., and Milgrom, P. R. Matching with contracts. American Economic Review 95 (2005), 913--935.
[4]
Milgrom, P. Putting Auction Theory to Work. Churchill Lectures in Economics. Cambridge University Press, 2004.
[5]
Ostrovsky, M. Stability in supply chain networks. American Economic Review 98 (2008), 897--923.
[6]
Roth, A. E. On the allocation of residents to rural hospitals: A general property of two-sided matching markets. Econometrica 54 (1986), 425--427.

Cited By

View all

Index Terms

  1. Matching in networks with bilateral contracts: extended abstract

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      EC '10: Proceedings of the 11th ACM conference on Electronic commerce
      June 2010
      400 pages
      ISBN:9781605588223
      DOI:10.1145/1807342

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 07 June 2010

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. matching
      2. networks
      3. quasisubmodularity
      4. stability
      5. substitutes

      Qualifiers

      • Extended-abstract

      Conference

      EC '10
      Sponsor:
      EC '10: ACM Conference on Electronic Commerce
      June 7 - 11, 2010
      Massachusetts, Cambridge, USA

      Acceptance Rates

      Overall Acceptance Rate 664 of 2,389 submissions, 28%

      Upcoming Conference

      EC '25
      The 25th ACM Conference on Economics and Computation
      July 7 - 11, 2025
      Stanford , CA , USA

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)14
      • Downloads (Last 6 weeks)4
      Reflects downloads up to 03 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media