<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: Monty Hall Revised</title>
	<atom:link href="http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/feed/" rel="self" type="application/rss+xml" />
	<link>http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/</link>
	<description>Strain your Brain</description>
	<lastBuildDate>Tue, 31 Aug 2010 17:39:33 -0700</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
	<item>
		<title>By: yaniv</title>
		<link>http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/comment-page-1/#comment-13315</link>
		<dc:creator>yaniv</dc:creator>
		<pubDate>Sat, 20 Dec 2008 18:48:32 +0000</pubDate>
		<guid isPermaLink="false">http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/#comment-13315</guid>
		<description>Seb,
Good to hear from you!

Danny,
Very well analyzed.  Note that in case the &quot;killing theory&quot; is correct (i.e. the host does not know where the prize is) switching is the best strategy only in a trivial sense - all the possible strategies are equivalent and give you a chance of exactly 0.5 of winning (given that you are not killed :-) ).

Yair,
:-)</description>
		<content:encoded><![CDATA[<p>Seb,<br />
Good to hear from you!</p>
<p>Danny,<br />
Very well analyzed.  Note that in case the &#8220;killing theory&#8221; is correct (i.e. the host does not know where the prize is) switching is the best strategy only in a trivial sense &#8211; all the possible strategies are equivalent and give you a chance of exactly 0.5 of winning (given that you are not killed <img src='http://leviathanonline.com/wordpress/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' />  ).</p>
<p>Yair,<br />
 <img src='http://leviathanonline.com/wordpress/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Yair</title>
		<link>http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/comment-page-1/#comment-13311</link>
		<dc:creator>Yair</dc:creator>
		<pubDate>Sat, 20 Dec 2008 16:26:01 +0000</pubDate>
		<guid isPermaLink="false">http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/#comment-13311</guid>
		<description>You forgot to mention that they also occasionally kill participants even if the host didn&#039;t ruin the show, just so the stats would be indistinguishable from the no-killing scenario.</description>
		<content:encoded><![CDATA[<p>You forgot to mention that they also occasionally kill participants even if the host didn&#8217;t ruin the show, just so the stats would be indistinguishable from the no-killing scenario.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Danny</title>
		<link>http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/comment-page-1/#comment-13260</link>
		<dc:creator>Danny</dc:creator>
		<pubDate>Fri, 19 Dec 2008 14:56:43 +0000</pubDate>
		<guid isPermaLink="false">http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/#comment-13260</guid>
		<description>(Oops! Definitions should be the other way around, i.e. H0 - with deaths; H1 - no deaths).</description>
		<content:encoded><![CDATA[<p>(Oops! Definitions should be the other way around, i.e. H0 &#8211; with deaths; H1 &#8211; no deaths).</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Danny</title>
		<link>http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/comment-page-1/#comment-13259</link>
		<dc:creator>Danny</dc:creator>
		<pubDate>Fri, 19 Dec 2008 14:52:52 +0000</pubDate>
		<guid isPermaLink="false">http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/#comment-13259</guid>
		<description>Interesting take on the original riddle. Here&#039;s my two cents:

We will only consider games in which the candidate chose to switch doors (obviously this is also the correct strategy, but we don&#039;t care, as we can simply ignore the other cases).

We need to distinguish between two hypotheses:
H0: The host never opens the prize door, all candidates get their 15 minutes of television fame.
H1: The host might open the prize door, in which case the candidate is executed.

WLOG we can assume the candidate&#039;s original choice was door #1 (everything is symmetrical, so it shouldn&#039;t really matter).

Now, there are 3 scenarios under H0, each w.p. 1/3:
1. The prize is behind door #1: so the host opens some random door 2 or 3, the candidate switches to the other one and loses.
2. The prize is behind door #2, so the host opens door #2 w.p. 1/2 and the candidate dies, or opens door #3 w.p. 1/2 and the candidate lives and wins.
3. the prize is behind door #3 - same as last.

All and all, under H0 we have:
candidate loses: 1/3
candidate wins: 1/3 * 1/2 * 2  = 1/3
candidate dies : 1/3 * 1/2 * 2 = 1/3

So under H0 and limiting ourselves to TV appearences only, we can expect to see about 1/2 of the candidates winning and the rest losing.

Under H1 we have also 3 scenarios, each w.p. 1/3:
1. The prize is behind door #1: so the host opens some random door 2 or 3, the candidate switches to the other one and loses.
2. The prize is behind door #2, so the host opens door #3 and and the candidate wins.
3. The prize is behind door #3 - same as last.

And all and all, under H1 we have:
candidate loses: 1/3
candidate wins: 1/3 * 2  = 2/3

So under H1 and limiting ourselves to TV appearences only, we can expect to see about 2/3 of the candidates winning and the rest losing.

Now we just need to apply the (weak) law of large numbers, compute the win proportion from the actual (virtually unlimited) television shows we have, and see which of H0 and H1 is more likely.</description>
		<content:encoded><![CDATA[<p>Interesting take on the original riddle. Here&#8217;s my two cents:</p>
<p>We will only consider games in which the candidate chose to switch doors (obviously this is also the correct strategy, but we don&#8217;t care, as we can simply ignore the other cases).</p>
<p>We need to distinguish between two hypotheses:<br />
H0: The host never opens the prize door, all candidates get their 15 minutes of television fame.<br />
H1: The host might open the prize door, in which case the candidate is executed.</p>
<p>WLOG we can assume the candidate&#8217;s original choice was door #1 (everything is symmetrical, so it shouldn&#8217;t really matter).</p>
<p>Now, there are 3 scenarios under H0, each w.p. 1/3:<br />
1. The prize is behind door #1: so the host opens some random door 2 or 3, the candidate switches to the other one and loses.<br />
2. The prize is behind door #2, so the host opens door #2 w.p. 1/2 and the candidate dies, or opens door #3 w.p. 1/2 and the candidate lives and wins.<br />
3. the prize is behind door #3 &#8211; same as last.</p>
<p>All and all, under H0 we have:<br />
candidate loses: 1/3<br />
candidate wins: 1/3 * 1/2 * 2  = 1/3<br />
candidate dies : 1/3 * 1/2 * 2 = 1/3</p>
<p>So under H0 and limiting ourselves to TV appearences only, we can expect to see about 1/2 of the candidates winning and the rest losing.</p>
<p>Under H1 we have also 3 scenarios, each w.p. 1/3:<br />
1. The prize is behind door #1: so the host opens some random door 2 or 3, the candidate switches to the other one and loses.<br />
2. The prize is behind door #2, so the host opens door #3 and and the candidate wins.<br />
3. The prize is behind door #3 &#8211; same as last.</p>
<p>And all and all, under H1 we have:<br />
candidate loses: 1/3<br />
candidate wins: 1/3 * 2  = 2/3</p>
<p>So under H1 and limiting ourselves to TV appearences only, we can expect to see about 2/3 of the candidates winning and the rest losing.</p>
<p>Now we just need to apply the (weak) law of large numbers, compute the win proportion from the actual (virtually unlimited) television shows we have, and see which of H0 and H1 is more likely.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Seb Przd</title>
		<link>http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/comment-page-1/#comment-13244</link>
		<dc:creator>Seb Przd</dc:creator>
		<pubDate>Fri, 19 Dec 2008 10:57:42 +0000</pubDate>
		<guid isPermaLink="false">http://yaniv.leviathanonline.com/blog/riddles/monty-hall-revised/#comment-13244</guid>
		<description>An interesting (and deadlier) variation...</description>
		<content:encoded><![CDATA[<p>An interesting (and deadlier) variation&#8230;</p>
]]></content:encoded>
	</item>
</channel>
</rss>
