Call (+1) 650-212-1212

Blog

An Optimal Valentine’s Date

Kim Mullins 14 Feb 2019 Modeling methods

“You know, Valentine’s Day reminds me of the optimal stopping problem.” Not sure if this phrase was uttered elsewhere, but, this is the sort of water cooler conversations at Lumina HQ. I had a recent conversation about the (somewhat old fashioned in name) secretary problem, and agree that app-driven dating is a decision problem well suited to the application of optimal stopping theory! Care of Prof. Thomas Ferguson, optimal stopping concerns itself with "the problem of choosing a time to take a given action based on sequentially observed random variables in order to maximize an expected payoff or to minimize an expected cost". In our case, that choice is a Valentine's Date.

(If the distillation of a human being into a single score necessary for the purposes of this exercise is distasteful to you, please picture Tudder instead of Tinder. Cows can now participate in #swipelife - what a world!)

I built a simple Analytica simulation to explore the optimal stopping in selecting an optimal Valentine’s date. You can download the model here, and run it in Analytica Free 101! I model a situation where you have 100 candidates. You swipe left 37 times (100/e) to figure out the best candidate of that bunch, and will swipe right on the first one you see who is better than the best in that learning set (or the 100th candidate, if nobody passes that test).

The model results over 100 simulations:

• 38% of the time, you will pick the single best (best single?) candidate -- this is as expected

• 64% of the time, you’ll swipe right on a great candidate (top 5% in my model); the rest of the time, you’ll pick whomever was last in line so as not to have no date (cow) at all. You'll see in the left figure below, you have ~uniform odds of picking any rank until you hit a rank above the top 10%.

• You’ll spend 27% less time making this decision than if you evaluated all 100 candidates. The right figure below illustrates this savings.

Cumulative probability of choosing each rank of candidate. Cumulative probability of evaluation time, comparing optimal stopping method versus exhaustive comparison.

I like this example topic because, at its core, its about reducing stress/time when making a decision. You have made a rational choice in matching the method to decision problem, and ideally feel neither FOMO (fear of missing out) nor FOBO (fear of better options) because you know you made great choice! And since this was framed as the Valentine’s Date Problem and not the Marriage Problem, you can try for a better outcome next Friday night if the candidate you picked wasn’t awesome.

» Back

Kim Mullins

Kimberley Mullins, PhD, is a Senior Consulting Analyst at Lumina. She holds a PhD jointly in Engineering & Public Policy and Civil & Environmental Engineering from Carnegie Mellon University. Her academic work focuses on risk analysis and assessing life-cycle environmental impacts of energy systems and agricultural systems. At Lumina, Kim is able to pursue two professional passions - helping people make better decisions through quantitative analysis, and improving energy systems. Outside of work hours, she's working up the cycling stamina to bike The Great Trail, which traverses Canada from the Pacific coast to the Atlantic.

Leave a Comment