Skip to main content
SpringerLink
Log in

Weighted Popular Matchings

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 41 Accesses

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.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

Recommended Reading

  1. Abraham DJ, Chen N, Kumar V, Mirrokni V (2006) Assignment problems in rental markets. In: Proceedings of the 2nd workshop on internet and network economics, Patras, 15–17 Dec 2006

    Google Scholar 

  2. Abraham DJ, Irving RW, Kavitha T, Mehlhorn K (2005) Popular matchings. In: Proceedings of the 16th annual ACM-SIAM symposium on discrete algorithms (SODA), pp 424–432

    Google Scholar 

  3. Abraham DJ, Kavitha T (2006) Dynamic matching markets and voting paths. In: Proceedings of the 10th Scandinavian workshop on algorithm theory (SWAT), Riga, 6–8 July 2006, pp 65–76

    Google Scholar 

  4. Gardenfors P (1975) Match making: assignments based on bilateral preferences. Behav Sci 20:166–173

    Article  Google Scholar 

  5. Hylland A, Zeeckhauser R (1979) The efficient allocation of individuals to positions. J Polit Econ 87(2):293–314

    Article  Google Scholar 

  6. Mahdian M (2006) Random popular matchings. In: Proceedings of the 7th ACM conference on electronic commerce (EC), Venice, 10–14 July 2006, pp 238–242

    Google Scholar 

  7. Manlove D, Sng C (2006) Popular matchings in the capacitated house allocation problem. In: Proceedings of the 14th annual European symposium on algorithms (ESA), pp 492–503

    Google Scholar 

  8. Mestre J (2006) Weighted popular matchings. In: Proceedings of the 16th international colloquium on automata, languages, and programming (ICALP), pp 715–726

    Google Scholar 

  9. Proll LG (1972) A simple method of assigning projects to students. Oper Res Q 23(23):195–201

    Article  Google Scholar 

  10. Yuan Y (1996) Residence exchange wanted: a stable residence exchange problem. Eur J Oper Res 90:536–546

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Maryland, College Park, MD, USA

    Julián Mestre

  2. School of Information Technologies, The University of Sydney, Sydney, NSW, Australia

    Julián Mestre

Authors
  1. Julián Mestre
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Mestre, J. (2016). Weighted Popular Matchings. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_477

Download citation

Publish with us

Policies and ethics

Search

Navigation