# "Should I break up with my girlfriend? Will I find another?" Or: An Algorithm for the Forecasting of Romantic Options

arXiv: https://arxiv.org/abs/1501.00637 · HTML: https://mlsanity.com/paper/1501.00637/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 4 Jan 2015.

## Built on by (most cited first, 1 of 1)

- [A Modified Drake Equation for Assessing Adversarial Risk to Machine Learning Models](https://mlsanity.com/paper/2103.02718/) (2021)

## Abstract (arXiv)

The prospect of finding love may be scary but the prospect of committing to a relationship for the rest of your life is almost certainly scary. The secretary problem is a parallel to romantic decision making where an individual decides when to be satisfied with a selection choice in the face of uncertain future options. However, the secretary problem and its variations still do not provide a practical solution in a world where individual preference, goals, and societal context create a highly complex space of values that factor into decision making. In light of these complexities, we offer a general process that can determine the value of romantic options in a highly personal context. This algorithm is currently being developed into a service that will be available in 2015 for the general public.