Skip to main content

Fundamentals of Matching Theory

  • Chapter
  • First Online:
Matching Theory for Wireless Networks

Part of the book series: Wireless Networks ((WN))

Abstract

Matching theory, in economics, is a mathematical framework that allows analyzing the formation of mutually beneficial relationships over time. Prior to the seminal work of Gale and Shapley on the stable marriage and college admission problems in 1962, many matching problems were solved by the “free for all market”. The “free for all market” term refers to the period before matching theory was conceived as a discipline, as well as the way in which matching problems were dealt with during the period. Economists have identified several issues such as unraveling, congestion, and exploding offers in the “free for all market”. Since then, with decades of efforts devoted to developing matching algorithms (i.e., there arises a trusted third party, which collects information, runs a matching algorithm, and broadcasts the matching results), these challenges were overcome. As a result, there has been a surge in the development of matching frameworks that have become widely used in many areas, such as the national resident matching program in the United States, the college admission in Hungary, the incompatible kidney exchange market, and the partnership formation in peer-to-peer (P2P) network, among others.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. D.F. Manlove, Algorithmics of Matching Under Preferences (World Scientific, New Jersey, 2013)

    Google Scholar 

  2. D. Gale, L.S. Shapley, College admissions and the stability of marriage. Am. Math. Mon. 69(1), 9–15 (1962)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhu Han .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Han, Z., Gu, Y., Saad, W. (2017). Fundamentals of Matching Theory. In: Matching Theory for Wireless Networks. Wireless Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-56252-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-56252-0_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-56251-3

  • Online ISBN: 978-3-319-56252-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics