<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>De Rerum Natura &#187; Game Theory</title>
	<atom:link href="http://www.corrada.com/blog/category/game-theory/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.corrada.com/blog</link>
	<description>Randomness, entropy, pattern matching, maps, geometry, knots, and scientific readings</description>
	<lastBuildDate>Sun, 25 Apr 2010 16:03:08 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Computation in series/parallel: Estimating the ideal throughput speed in uncertain traffic conditions</title>
		<link>http://www.corrada.com/blog/2007/10/14/computation-in-seriesparallel-estimating-the-ideal-throughput-speed-in-uncertain-traffic-conditions/</link>
		<comments>http://www.corrada.com/blog/2007/10/14/computation-in-seriesparallel-estimating-the-ideal-throughput-speed-in-uncertain-traffic-conditions/#comments</comments>
		<pubDate>Mon, 15 Oct 2007 00:07:55 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Error Theory]]></category>
		<category><![CDATA[Game Theory]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=18</guid>
		<description><![CDATA[One of my favorite games to play when I drive is to try to estimate the ideal throughput speed &#8212; the speed at which you can go through traffic without having to change your speed. This involves a couple of behavioral changes: you have to allow more space than normal between you and the car [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2007/10/14/computation-in-seriesparallel-estimating-the-ideal-throughput-speed-in-uncertain-traffic-conditions/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The strategic advantage of stabilizing errors in uncertain environments</title>
		<link>http://www.corrada.com/blog/2007/10/07/the-strategic-advantage-of-stabilizing-errors-in-uncertain-environments/</link>
		<comments>http://www.corrada.com/blog/2007/10/07/the-strategic-advantage-of-stabilizing-errors-in-uncertain-environments/#comments</comments>
		<pubDate>Sun, 07 Oct 2007 20:50:45 +0000</pubDate>
		<dc:creator>Andrés</dc:creator>
				<category><![CDATA[Error Theory]]></category>
		<category><![CDATA[Game Theory]]></category>
		<category><![CDATA[Machine Learning]]></category>
		<category><![CDATA[Randomness]]></category>

		<guid isPermaLink="false">http://www.corrada.com/blog/?p=14</guid>
		<description><![CDATA[This weekend I was talking to a friend from graduate school about how to stabilize errors in uncertain environments by sacrificing accuracy, the subject of the previous two posts. During the conversation, I realized another advantage of stabilizing errors: it makes it easier to modify your detector/classifier in an adversarial situation.
The &#8220;arms race&#8221; game is [...]]]></description>
		<wfw:commentRss>http://www.corrada.com/blog/2007/10/07/the-strategic-advantage-of-stabilizing-errors-in-uncertain-environments/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
