Skip to main content
SpringerLink
Log in

Soulmate Algorithms

  • Chapter
  • First Online:
Programming Languages with Applications to Biology and Security

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9465))

  • 1031 Accesses

Abstract

Consulting dating on-line sites, or adopting greedy algorithms, exhaustive search, approximation, and random search are some of the strategies that can be used to find a soulmate. We discuss techniques and show true life examples, leaving the choice of selecting the most satisfactory method to the reader interested in such an activity.

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 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

Notes

  1. 1.

    The relationship between Martin’s conduct and computability theory was pointed out for the first time in [5].

  2. 2.

    If I won’t find her / who is so beautiful / I will settle for / finding her sister ...

References

  1. http://seigradi.corriere.it/2014/01/23/il-matematico-che-ha-scoperto-lalgoritmo-perfetto-per-trovare-una-donna/ (2014)

  2. Big Data and Relationships: Is there a secret Algorithm for Love? The Big Data Landscape. http://www.bigdatalandscape.com/blog/big-data-relationships-secret-algorithm-love

  3. Crescenzi, P.: Firenze. http://www.editelonline.it/222337-1/incontri-in-corso-agenzia-per-single-di-pierluigi-crescenzi-agenzie-matrimoniali.html

  4. Kundera, M.: Laughable Loves. Faber and Faber, London (2000)

    Google Scholar 

  5. Luccio, F., Pagli, L.: Algoritmi divinità e gente comune. ETS, Pisa (1999)

    Google Scholar 

  6. Cutolo, R., Cioffi, G.: Dove sta Zazà. Ed. Musicali Cioffi, Napoli (1944)

    Google Scholar 

  7. Kundera, M.: The Unbearable Lightness of Being. Faber and Faber, London (1984)

    Google Scholar 

  8. Zampa, L.: Bello, onesto, emigrato Australia sposerebbe compaesana illibata. CEIAD Columbia (1971)

    Google Scholar 

  9. Belli, G.: El pergamino de la seducción. Seix Barral, Barcelona (2005)

    Google Scholar 

  10. Reiner, R.: When Harry met Sally. Columbia Pictures (1989) (writer Nora Ephron)

    Google Scholar 

  11. Knuth, D.E.: Stable marriage and its relation to other combinatorial problems. In: CRM Proceedings and Lecture Notes, vol. 10. American Mathematical Society (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Pisa, Italy

    Fabrizio Luccio & Linda Pagli

Authors
  1. Fabrizio Luccio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Linda Pagli
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Linda Pagli .

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Pisa, Italy

    Chiara Bodei

  2. Dipartimento di Informatica, Università di Pisa, Pisa, Italy

    Gianluigi Ferrari

  3. Università degli Studi di Trento, Povo, Italy

    Corrado Priami

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Luccio, F., Pagli, L. (2015). Soulmate Algorithms. In: Bodei, C., Ferrari, G., Priami, C. (eds) Programming Languages with Applications to Biology and Security. Lecture Notes in Computer Science(), vol 9465. Springer, Cham. https://doi.org/10.1007/978-3-319-25527-9_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-25527-9_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-25526-2

  • Online ISBN: 978-3-319-25527-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation