Found in 5 comments on Hacker News
AS_of · 2021-05-10 · Original thread
As you get older, you should read fewer new books, and revisit the ones that have you the most joy. Vacation sounds like a great place for that!

Edit: why? Because you believe in the leverage algorithms can provide https://www.amazon.com/Algorithms-Live-Computer-Science-Deci...

There are probably a lot of single people here that would benefit from that book as well (the stopping problem)

We all "know" the algos. But reading/hearing how they can be applied and what effect they can have on your life can be enlightening.

joubert · 2021-01-10 · Original thread
I can also recommend "Algorithms to Live By", by Brian Christian & Tom Griffiths. https://www.amazon.com/Algorithms-Live-Computer-Science-Deci...

Super accessible.

itsmejeff · 2018-04-06 · Original thread
The Nash equilibrium for an unlimited vacation policy is no vacation for anyone.

https://www.amazon.com/Algorithms-Live-Computer-Science-Deci...

elorm · 2017-08-15 · Original thread
This is a bit vague, but here are some suggestions

Algorithms to live by Brian Christian https://www.amazon.ca/Algorithms-Live-Computer-Science-Decis...

Bad Choices: How Algorithms Can Help You Think Smarter and Live Happier by Ali Almossawi https://www.amazon.ca/Bad-Choices-Algorithms-Smarter-Happier...

jasode · 2016-10-08 · Original thread
>So is there an ideally sized choice set when it comes to dating—one large enough to include variety and depth, yet small enough that you can fairly weigh each prospect’s potential without tripping your brain’s overload switch? [...] Fisher puts people somewhere in the middle of that range. “Once you’ve met nine people who are vaguely in the ballpark, choose one and get to know that person better. If nothing works in that nine, go for another nine,” she says.

The article talks about simultaneous choices (choice overload). A related concept is serial choices and the "when to stop looking for The One" dilemma. That's been modeled as The Secretary Problem[1] which calculates a 37% stopping point. It also has been discussed by several authors: [2] [3] [4] [5]

[1]https://en.wikipedia.org/wiki/Secretary_problem

[2]https://www.amazon.com/Algorithms-Live-Computer-Science-Deci...

[3]https://youtu.be/OwKj-wgXteo?t=10m12s

[4]https://www.amazon.com/Mathematics-Love-Patterns-Ultimate-Eq...

[5]https://www.ted.com/talks/hannah_fry_the_mathematics_of_love...

Fresh book recommendations delivered straight to your inbox every Thursday.