1996-07-28 - Re: Twenty Beautiful Women

Header Data

From: David Sternlight <david@sternlight.com>
To: tcmay@got.net (Timothy C. May)
Message Hash: 660be33f58c831feade16d7068c70066d21ecb7278c3de61320cbc0b4086ef9a
Message ID: <v03007801ae20758ab052@[192.187.162.15]>
Reply To: <ae2005a310021004b85c@[205.199.118.202]>
UTC Datetime: 1996-07-28 03:38:52 UTC
Raw Date: Sun, 28 Jul 1996 11:38:52 +0800

Raw message

From: David Sternlight <david@sternlight.com>
Date: Sun, 28 Jul 1996 11:38:52 +0800
To: tcmay@got.net (Timothy C. May)
Subject: Re: Twenty Beautiful Women
In-Reply-To: <ae2005a310021004b85c@[205.199.118.202]>
Message-ID: <v03007801ae20758ab052@[192.187.162.15]>
MIME-Version: 1.0
Content-Type: text/plain


At 10:29 AM -0700 7/28/96, Timothy C. May wrote:
>At 6:19 PM 7/27/96, David Sternlight wrote:
>>Here's another:
>>
>>Twenty beautiful women are to pass before you, one by one (or 20 handsome
>>men). You see only one at a time. You cannot speak to them. After seeing
>>any one, you must pick her or reject her. If you reject her, you cannot
>>change your mind. If you pick her the exercise terminates.
>>
>>What is the optimal strategy for insuring you get the most beautiful woman
>>possible under the circumstances?
>
>Look at the first 1/e of them, or about the first 36.8% of them. In this
>case, the first 7 of them. Then pick the first one after this group which
>is better than any of the first group.
>
>While there is some chance that one will get to #20 and find that none of
>#8-20 were better than #1-7, this strategy is the best compromise between
>"committing too early" and "waiting too long."

Correct.

David







Thread