{"id":6123,"date":"2015-07-07T10:44:09","date_gmt":"2015-07-07T17:44:09","guid":{"rendered":"https:\/\/www.scotthyoung.com\/blog\/?p=6123"},"modified":"2019-03-08T09:20:16","modified_gmt":"2019-03-08T17:20:16","slug":"building-searching","status":"publish","type":"post","link":"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/","title":{"rendered":"Building, Searching and the Algorithm for Finding the Best Spouse"},"content":{"rendered":"

Let me tell you about my favorite mathematical proof.<\/p>\n

It\u2019s for a puzzle called the marriage problem<\/a> (alternatively called the secretary problem or the sultan\u2019s dowry). It\u2019s my favorite for belonging to a rare category of \u201cmathematical proofs which also have to do with sex.\u201d<\/p>\n

The problem is very simple:<\/p>\n

Suppose you are looking to get hitched. You have many people you could potentially marry. How do you find the best spouse?<\/p>\n

Well, as a mathematical puzzle, rather than a human one, we need to define the process for finding and evaluating suitors a bit more rigidly to answer that question.<\/p>\n

The rules of this particular puzzle are defined as follows:<\/p>\n

    \n
  1. Each potential suitor you meet, you can go on a date (or a few) with them. During this time, you\u2019re able to evaluate their suitability.<\/li>\n
  2. After each dating period, assuming the person is willing to propose to you, you can either accept or reject the suitor.<\/li>\n
  3. If you accept the person, great, you\u2019re now hitched.<\/li>\n
  4. If you reject the person, move onto the next.<\/li>\n
  5. In either case, accept or reject, you\u2019re not allowed to go back and change your mind later. Once you reject someone, you can\u2019t go back to them if you realize they were the one for you. Once you accept someone, you can\u2019t change your mind if you meet someone else.<\/li>\n
  6. You aren\u2019t allowed to date more than one person at a time.<\/li>\n<\/ol>\n

    This puzzle has a more formal, mathematical definition, that can work as an analogy for a lot more than just spouses. You could, for example, also think of this as an employer looking for the best employee, but is required to either hire or reject each applicant, one at a time.<\/p>\n

    Interestingly enough, this puzzle has a solution. As in, there is a mathematically provable optimal algorithm for deciding the best spouse.<\/p>\n

    The Algorithm for the Best Spouse<\/h2>\n

    The algorithm has two parts: what I\u2019ll call a \u201crejection\u201d phase and a \u201cchoosing\u201d phase.<\/p>\n

    During the initial rejection phase, you reject every single applicant who proposes to you. It doesn\u2019t matter how good they are, you just reject them. (In the formal definition you do this for the first n\/e candidates, or roughly the first 40% of people.)<\/p>\n

    Then, after the rejection phase, you enter a new, choosing phase. Now you agree to marry the first candidate who is better than every other suitor you dated who also agreed to marry you.<\/p>\n

    With this algorithm, you can demonstrate that you will, in fact, select the best possible spouse a whopping 37% of the time, regardless of whether there are ten billion applicants or only ten.<\/p>\n

    No, You Can\u2019t Actually Use This Algorithm to Find a Spouse<\/h2>\n

    Obviously the mathematical solution to this puzzle won\u2019t work strictly in real life. Many of the assumptions of the model are violated: you don\u2019t know how many people you might potentially date, you don\u2019t know whether the suitability of the suitors is time-dependent, you have access to information about people you aren\u2019t currently dating which can inform you of the relative merits of those you are, etc.<\/p>\n

    It also goes without saying that basing your love life on an algorithm is a pretty poor way to live.<\/p>\n

    However, there is something I like about this algorithm, and I believe it can offer an analogy, if not a solution, for thinking about many areas of life.<\/p>\n

    Searching and Building<\/h2>\n

    In short, the algorithm does two things. First, it has a searching capability. It spends a certain amount of time not making a decision at all, but simply gathering information about the overall range of suitability of the different options.<\/p>\n

    Second, it has a deciding capability. This is where you have gathered enough information and now need to make a choice.<\/p>\n

    While the algorithm only deals with the decision phase, most areas of life also have a follow-up part. They have not only a part where you must choose the best option, but also a point when you have to build on that choice you\u2019ve made. A good marriage isn\u2019t just selecting the right spouse, after all, but years of investment into building a relationship with that person.<\/p>\n

    Therefore, in a real context, I\u2019d describe the split as being between searching and building. Searching, when you lack enough experience to know what to choose, and building, when you have enough data and now need to just make a choice and run with it.<\/p>\n

    What interests me about the ideal algorithm is that it divides itself neatly into these two phases. Search for awhile and then, abruptly, switch to deciding (or in our real world case, building).<\/p>\n

    Should You Search or Build?<\/h2>\n

    Unfortunately, real life doesn\u2019t offer a precise point to switch from one phase to the other, like in our idealized mathematical problem. But I do think the puzzle does illustrate the need for both searching and building in different areas of life.<\/p>\n

    Consider many decisions: which city to live in, what career to go into, what friends to associate with or habits to create. In many ways, they suffer from the same problems as the original puzzle I outlined: you have many options and you don\u2019t know which to pick. Yet, at the same time, you know that once you do pick you\u2019ll have to put in a lot of effort to make them work anyways.<\/p>\n

    Ask yourself whether your problem is a lack of information? If so, entering a searching phase where you don\u2019t choose anything but explore options might be best. Spend some time living in different cities before picking a home. Spend some time in different jobs before picking a career. Spend some time with different groups of people before finding a tribe.<\/p>\n

    Do you have information, but can\u2019t make a choice? If so, maybe you need to stop shuffling around, pick something and start building on it. Fretting over what is the right business idea? Maybe you already have enough information and just need to make a choice and commit to it.<\/p>\n

    What interests me about the algorithm is that the ideal solution may have two distinct phases, depending on where you sit. Which is better depends crucially on how much information you already possess, hence the seemingly endless contradictory advice between gathering more information and taking action.<\/p>\n

    Please note the \u201creject the first 40% of all applicants\u201d really only applies in this formal puzzle. If you got married early or late, live in your hometown or haven\u2019t settled into one by middle age, that shouldn\u2019t imply you made an incorrect choice. Changing any of the assumptions can lead to very different outcomes for the algorithm.<\/p>\n

    That being said, look over the areas of your life. Could they benefit from more searching or do they need commitment? Share your thoughts in the comments.<\/p>\n","protected":false},"excerpt":{"rendered":"

    Let me tell you about my favorite mathematical proof. It\u2019s for a puzzle called the marriage problem (alternatively called the secretary problem or the sultan\u2019s dowry). It\u2019s my favorite for belonging to a rare category of \u201cmathematical proofs which also have to do with sex.\u201d The problem is very simple: Suppose you are looking to […]<\/p>\n","protected":false},"author":7,"featured_media":0,"comment_status":"open","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"om_disable_all_campaigns":false,"_monsterinsights_skip_tracking":false,"_monsterinsights_sitenote_active":false,"_monsterinsights_sitenote_note":"","_monsterinsights_sitenote_category":0,"_genesis_hide_title":false,"_genesis_hide_breadcrumbs":false,"_genesis_hide_singular_image":false,"_genesis_hide_footer_widgets":false,"_genesis_custom_body_class":"","_genesis_custom_post_class":"","_genesis_layout":"","footnotes":"","_links_to":"","_links_to_target":""},"categories":[656,681],"tags":[],"class_list":{"0":"post-6123","1":"post","2":"type-post","3":"status-publish","4":"format-standard","6":"category-life-philosophy","7":"category-nc-mindset","8":"entry"},"acf":[],"yoast_head":"\nBuilding, Searching and the Algorithm for Finding the Best Spouse - Scott H Young<\/title>\n<meta name=\"description\" content=\"My favorite mathematical puzzle is the marriage proof. It doesn\u2019t help you find a spouse, but it encourages searching for more before building something.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Building, Searching and the Algorithm for Finding the Best Spouse - Scott H Young\" \/>\n<meta property=\"og:description\" content=\"My favorite mathematical puzzle is the marriage proof. It doesn\u2019t help you find a spouse, but it encourages searching for more before building something.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/\" \/>\n<meta property=\"og:site_name\" content=\"Scott H Young\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/AuthorScottYoung\/\" \/>\n<meta property=\"article:published_time\" content=\"2015-07-07T17:44:09+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2019-03-08T17:20:16+00:00\" \/>\n<meta name=\"author\" content=\"Scott Young\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@scotthyoung\" \/>\n<meta name=\"twitter:site\" content=\"@scotthyoung\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Scott Young\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"6 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/2015\\\/07\\\/07\\\/building-searching\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/2015\\\/07\\\/07\\\/building-searching\\\/\"},\"author\":{\"name\":\"Scott Young\",\"@id\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/#\\\/schema\\\/person\\\/2f58ab6c4a36422c78416e5b7a79604c\"},\"headline\":\"Building, Searching and the Algorithm for Finding the Best Spouse\",\"datePublished\":\"2015-07-07T17:44:09+00:00\",\"dateModified\":\"2019-03-08T17:20:16+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/2015\\\/07\\\/07\\\/building-searching\\\/\"},\"wordCount\":1172,\"commentCount\":28,\"articleSection\":[\"Life Philosophy\",\"Mindset\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/2015\\\/07\\\/07\\\/building-searching\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/2015\\\/07\\\/07\\\/building-searching\\\/\",\"url\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/2015\\\/07\\\/07\\\/building-searching\\\/\",\"name\":\"Building, Searching and the Algorithm for Finding the Best Spouse - Scott H Young\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/#website\"},\"datePublished\":\"2015-07-07T17:44:09+00:00\",\"dateModified\":\"2019-03-08T17:20:16+00:00\",\"author\":{\"@id\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/#\\\/schema\\\/person\\\/2f58ab6c4a36422c78416e5b7a79604c\"},\"description\":\"My favorite mathematical puzzle is the marriage proof. It doesn\u2019t help you find a spouse, but it encourages searching for more before building something.\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/2015\\\/07\\\/07\\\/building-searching\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/2015\\\/07\\\/07\\\/building-searching\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/2015\\\/07\\\/07\\\/building-searching\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Building, Searching and the Algorithm for Finding the Best Spouse\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/#website\",\"url\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/\",\"name\":\"Scott H Young\",\"description\":\"Learn faster, achieve more\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/#\\\/schema\\\/person\\\/2f58ab6c4a36422c78416e5b7a79604c\",\"name\":\"Scott Young\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/a2da240fb070ba8346e3be8b89043b66c39bdcf933d9e7311dcb10383d0bc645?s=96&d=mm&r=g\",\"url\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/a2da240fb070ba8346e3be8b89043b66c39bdcf933d9e7311dcb10383d0bc645?s=96&d=mm&r=g\",\"contentUrl\":\"https:\\\/\\\/secure.gravatar.com\\\/avatar\\\/a2da240fb070ba8346e3be8b89043b66c39bdcf933d9e7311dcb10383d0bc645?s=96&d=mm&r=g\",\"caption\":\"Scott Young\"},\"description\":\"Hello, my name is Scott H. Young and I am obsessed with personal development! When I am not reading several books a month on the subject I am constantly trying to find new ways to improve and get more out of life.\",\"sameAs\":[\"https:\\\/\\\/www.scotthyoung.com\"],\"url\":\"https:\\\/\\\/www.scotthyoung.com\\\/blog\\\/author\\\/scottadmin\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Building, Searching and the Algorithm for Finding the Best Spouse - Scott H Young","description":"My favorite mathematical puzzle is the marriage proof. It doesn\u2019t help you find a spouse, but it encourages searching for more before building something.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/","og_locale":"en_US","og_type":"article","og_title":"Building, Searching and the Algorithm for Finding the Best Spouse - Scott H Young","og_description":"My favorite mathematical puzzle is the marriage proof. It doesn\u2019t help you find a spouse, but it encourages searching for more before building something.","og_url":"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/","og_site_name":"Scott H Young","article_publisher":"https:\/\/www.facebook.com\/AuthorScottYoung\/","article_published_time":"2015-07-07T17:44:09+00:00","article_modified_time":"2019-03-08T17:20:16+00:00","author":"Scott Young","twitter_card":"summary_large_image","twitter_creator":"@scotthyoung","twitter_site":"@scotthyoung","twitter_misc":{"Written by":"Scott Young","Est. reading time":"6 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/#article","isPartOf":{"@id":"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/"},"author":{"name":"Scott Young","@id":"https:\/\/www.scotthyoung.com\/blog\/#\/schema\/person\/2f58ab6c4a36422c78416e5b7a79604c"},"headline":"Building, Searching and the Algorithm for Finding the Best Spouse","datePublished":"2015-07-07T17:44:09+00:00","dateModified":"2019-03-08T17:20:16+00:00","mainEntityOfPage":{"@id":"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/"},"wordCount":1172,"commentCount":28,"articleSection":["Life Philosophy","Mindset"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/","url":"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/","name":"Building, Searching and the Algorithm for Finding the Best Spouse - Scott H Young","isPartOf":{"@id":"https:\/\/www.scotthyoung.com\/blog\/#website"},"datePublished":"2015-07-07T17:44:09+00:00","dateModified":"2019-03-08T17:20:16+00:00","author":{"@id":"https:\/\/www.scotthyoung.com\/blog\/#\/schema\/person\/2f58ab6c4a36422c78416e5b7a79604c"},"description":"My favorite mathematical puzzle is the marriage proof. It doesn\u2019t help you find a spouse, but it encourages searching for more before building something.","breadcrumb":{"@id":"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/www.scotthyoung.com\/blog\/2015\/07\/07\/building-searching\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/www.scotthyoung.com\/blog\/"},{"@type":"ListItem","position":2,"name":"Building, Searching and the Algorithm for Finding the Best Spouse"}]},{"@type":"WebSite","@id":"https:\/\/www.scotthyoung.com\/blog\/#website","url":"https:\/\/www.scotthyoung.com\/blog\/","name":"Scott H Young","description":"Learn faster, achieve more","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.scotthyoung.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Person","@id":"https:\/\/www.scotthyoung.com\/blog\/#\/schema\/person\/2f58ab6c4a36422c78416e5b7a79604c","name":"Scott Young","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/secure.gravatar.com\/avatar\/a2da240fb070ba8346e3be8b89043b66c39bdcf933d9e7311dcb10383d0bc645?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/a2da240fb070ba8346e3be8b89043b66c39bdcf933d9e7311dcb10383d0bc645?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/a2da240fb070ba8346e3be8b89043b66c39bdcf933d9e7311dcb10383d0bc645?s=96&d=mm&r=g","caption":"Scott Young"},"description":"Hello, my name is Scott H. Young and I am obsessed with personal development! When I am not reading several books a month on the subject I am constantly trying to find new ways to improve and get more out of life.","sameAs":["https:\/\/www.scotthyoung.com"],"url":"https:\/\/www.scotthyoung.com\/blog\/author\/scottadmin\/"}]}},"_links":{"self":[{"href":"https:\/\/www.scotthyoung.com\/blog\/wp-json\/wp\/v2\/posts\/6123","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.scotthyoung.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.scotthyoung.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.scotthyoung.com\/blog\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/www.scotthyoung.com\/blog\/wp-json\/wp\/v2\/comments?post=6123"}],"version-history":[{"count":2,"href":"https:\/\/www.scotthyoung.com\/blog\/wp-json\/wp\/v2\/posts\/6123\/revisions"}],"predecessor-version":[{"id":6125,"href":"https:\/\/www.scotthyoung.com\/blog\/wp-json\/wp\/v2\/posts\/6123\/revisions\/6125"}],"wp:attachment":[{"href":"https:\/\/www.scotthyoung.com\/blog\/wp-json\/wp\/v2\/media?parent=6123"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.scotthyoung.com\/blog\/wp-json\/wp\/v2\/categories?post=6123"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.scotthyoung.com\/blog\/wp-json\/wp\/v2\/tags?post=6123"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}