Skip to main content

Compact Preference Representation via Fuzzy Constraints in Stable Matching Problems

  • Conference paper
  • First Online:
Algorithmic Decision Theory (ADT 2017)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10576))

Included in the following conference series:

Abstract

We define a framework for stable matching problems where agents are allowed to express their preferences in a compact way, via fuzzy constraints over the features describing the agents of the other group. We provide a solving engine for this new kind of stable matching problems that does not increase the time complexity of the classical GS algorithm, while maintaining stability of the matching returned. We then evaluate the approach experimentally.

Francesca Rossi—(on leave from University of Padova, Italy).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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. Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. JAIR 21, 135–191 (2004)

    Article  MathSciNet  Google Scholar 

  2. Brafman, R.I., Rossi, F., Salvagnin, D., Venable, K.B., Walsh, T.: Finding the next solution in constraint-and preference-based knowledge representation formalisms. In: Proceedings KR 2010 (2010)

    Google Scholar 

  3. Dechter, R.: Tractable structures for CSPs. In: Rossi, F., Van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier (2005)

    Google Scholar 

  4. Dechter, R., Flerova, N., Marinescu, R.: Search algorithms for m best solutions for graphical models. In: Proceedings AAAI 2012. AAAI Press (2012)

    Google Scholar 

  5. Gale, D., Shapley, L.S.: College admissions and the stability of marriage. Amer. Math. Monthly 69, 9–14 (1962)

    Article  MathSciNet  Google Scholar 

  6. Gusfield, D., Irving, R.W.: The Stable Marriage Problem: Structure and Algorithms. MIT Press, Boston (1989)

    MATH  Google Scholar 

  7. Meseguer, P., Rossi, F., Schiex, T.: Soft constraints. In: Rossi, F., Van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming. Elsevier (2005)

    Google Scholar 

  8. Pilotto, E., Rossi, F., Venable, K.B., Walsh, T.: Compact preference representation in stable marriage problems. In: Rossi, F., Tsoukias, A. (eds.) ADT 2009. LNCS, vol. 5783, pp. 390–401. Springer, Heidelberg (2009). doi:10.1007/978-3-642-04428-1_34

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Maria Silvia Pini .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Pini, M.S., Rossi, F., Venable, K.B. (2017). Compact Preference Representation via Fuzzy Constraints in Stable Matching Problems. In: Rothe, J. (eds) Algorithmic Decision Theory. ADT 2017. Lecture Notes in Computer Science(), vol 10576. Springer, Cham. https://doi.org/10.1007/978-3-319-67504-6_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67504-6_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-67503-9

  • Online ISBN: 978-3-319-67504-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics