<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Fri, 10 Apr 2026 22:58:24 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/algorithmstoliveby/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Algorithms To Live By #5: Optimal Stopping And Parking In The City]]></title><description><![CDATA[So far, we have talked about the secretary problem, or more generally, about optimal stopping, and how it can be useful to model when to sell a house, or how to look for a romantic partner. There are many]]></description><link>http://direct.ecency.com/algorithmstoliveby/@capatazche/algorithms-to-live-by-5-optimal-stopping-and-parking-in-the-city</link><guid isPermaLink="true">http://direct.ecency.com/algorithmstoliveby/@capatazche/algorithms-to-live-by-5-optimal-stopping-and-parking-in-the-city</guid><category><![CDATA[algorithmstoliveby]]></category><dc:creator><![CDATA[capatazche]]></dc:creator><pubDate>Tue, 05 Jun 2018 10:51:06 GMT</pubDate><enclosure url="https://images.ecency.com/p/54TLbcUcnRm3sWQK3HKkuAMedF1JSX7yKgEqYjnyTKPwrcc6o5iHoySLh553TbTAZtg5V13U5JNc4V1kMhTpwCgBSM7Wkg4ip76Et3hUftoxAMXVrC6MWP8H4Yvy6KeNXmvRa7XJN?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Algorithms To Live By #4: How Does The Secretary Problem Changes With More Information?]]></title><description><![CDATA[For the proper understanding of this post, you will need to know about the secretary problem. You can find information on it in an older post. In the last edition of 'Algorithms To Live By', we discussed]]></description><link>http://direct.ecency.com/algorithmstoliveby/@capatazche/algorithms-to-live-by-4-how-does-the-secretary-problem-changes-with-more-information</link><guid isPermaLink="true">http://direct.ecency.com/algorithmstoliveby/@capatazche/algorithms-to-live-by-4-how-does-the-secretary-problem-changes-with-more-information</guid><category><![CDATA[algorithmstoliveby]]></category><dc:creator><![CDATA[capatazche]]></dc:creator><pubDate>Sun, 20 May 2018 16:31:30 GMT</pubDate><enclosure url="https://images.ecency.com/p/cyxkEVqiiLyAJMrzqHfWLT7YbdgoprDQGwdeDRwrZUnqRK7HcahJWu66JVRi7oiZSLpjZnNPEGsJ9dVtnWmJSU1MTnkiHWsaBGXbKKUjz7KTKBATFtyRY9tXBXX3E7LduFU?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Algorithms To Live By #3: The 37% Rule Applied To Partner Searching]]></title><description><![CDATA[For the proper understanding of this post, you will need to know about the 37% rule and the secretary problem. You can find information on both in my last edition of "Algorithms To Live By".]]></description><link>http://direct.ecency.com/algorithmstoliveby/@capatazche/algorithms-to-live-by-3-the-37-rule-applied-to-partner-searching</link><guid isPermaLink="true">http://direct.ecency.com/algorithmstoliveby/@capatazche/algorithms-to-live-by-3-the-37-rule-applied-to-partner-searching</guid><category><![CDATA[algorithmstoliveby]]></category><dc:creator><![CDATA[capatazche]]></dc:creator><pubDate>Wed, 16 May 2018 17:13:15 GMT</pubDate><enclosure url="https://images.ecency.com/p/cyxkEVqiiLyAJMrzqHfWLT7YbdgoprDQGwdeDRwrZUnqRK7HcahJWu66JVRi7oiZSLpjZnNPEGsJ9dVtnWmJSU1MTnkiHWsaBGXbKKUjz7KTKBATFtyRY9tXBXX3E7LduFU?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Algorithms To Live By #2: Optimal Stopping - How Long To Look For And When To Stop To Find The Best (The 37% Rule)]]></title><description><![CDATA[The 37% rule came to exist as a result of the study of optimal's stopping most famous puzzle, the secretary problem. The setup of the problem is as follows. Imagine you are interviewing candidates for]]></description><link>http://direct.ecency.com/algorithmstoliveby/@capatazche/algorithms-to-live-by-2-optimal-stopping-how-long-to-look-for-and-when-to-stop-to-find-the-best-the-37-rule</link><guid isPermaLink="true">http://direct.ecency.com/algorithmstoliveby/@capatazche/algorithms-to-live-by-2-optimal-stopping-how-long-to-look-for-and-when-to-stop-to-find-the-best-the-37-rule</guid><category><![CDATA[algorithmstoliveby]]></category><dc:creator><![CDATA[capatazche]]></dc:creator><pubDate>Thu, 10 May 2018 09:46:42 GMT</pubDate><enclosure url="https://images.ecency.com/p/cyxkEVqiiLyAJMrzqHfWLT7YbdgoprDQGwdeDRwrZUnqRK7HcahJWu66JVRi7oiZSLpjZnNPEGsJ9dVtnWmJSU1MTnkiHWsaBGXbKKUjz7KTKBATFtyRY9tXBXX3E7LduFU?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Algorithms To Live By #1: Expectations, Authors, And Algorithms]]></title><description><![CDATA[As the followers of my series might know, I usually have two series running side by side. I do this because very often ideas from one series nurture ideas for the other one. Furthermore, it helps make]]></description><link>http://direct.ecency.com/algorithmstoliveby/@capatazche/algorithms-to-live-by-1-expectations-authors-and-first-ideas</link><guid isPermaLink="true">http://direct.ecency.com/algorithmstoliveby/@capatazche/algorithms-to-live-by-1-expectations-authors-and-first-ideas</guid><category><![CDATA[algorithmstoliveby]]></category><dc:creator><![CDATA[capatazche]]></dc:creator><pubDate>Sat, 05 May 2018 02:30:00 GMT</pubDate><enclosure url="https://images.ecency.com/p/2gsjgna1uruvUuS7ndh9YqVwYGPLVszbFLwwpAYXYbdxWdUvZRJE9zCj6mU3GJxssAQqSQCa6naLMhE58krw345zx9yUnPYqJ1ETkUgi53FgdL2xAA?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>