{"id":344,"date":"2011-11-23T09:12:42","date_gmt":"2011-11-23T14:12:42","guid":{"rendered":"http:\/\/blogs.cuit.columbia.edu\/logic\/?p=344"},"modified":"2011-12-08T13:16:50","modified_gmt":"2011-12-08T18:16:50","slug":"joe-halpern-iterated-regret-minimization","status":"publish","type":"post","link":"https:\/\/blogs.cuit.columbia.edu\/logic\/?p=344","title":{"rendered":"Joe Halpern: Iterated Regret Minimization"},"content":{"rendered":"<p style=\"text-align: justify\">SEMINAR IN LOGIC AND GAMES AT CUNY<\/p>\n<p style=\"text-align: justify\"><strong>Iterated Regret Minimization: a new solution concept<\/strong><br \/>\n<a href=\"http:\/\/www.cs.cornell.edu\/home\/halpern\/\">Joe Halpern<\/a> (Cornell)<br \/>\nFriday, December 9, 4:15 PM<br \/>\nRoom 9205, CUNY Graduate Center<\/p>\n<p style=\"text-align: justify\"><em>Abstract.<\/em> For some well-known games, such as the Traveler&#8217;s Dilemma or the\u00a0Centipede Game, traditional game-theoretic solution concepts &#8212; most\u00a0notably Nash equilibrium &#8212; predict outcomes that are not consistent\u00a0with empirical observations. We introduce a new solution concept,\u00a0iterated regret minimization, which exhibits the same qualitative\u00a0behavior as that observed in experiments in many games of interest,\u00a0including Traveler&#8217;s Dilemma, the Centipede Game, Nash bargaining, and\u00a0Bertrand competition. As the name suggests, iterated regret minimization\u00a0involves the iterated deletion of strategies that do not minimize regret.\u00a0We provide an epistemic characterization of iterated regret minimization,\u00a0and show that it predicts reasonable outcomes in many situations of\u00a0interest. (This represents joint work with Rafael Pass)<\/p>\n","protected":false},"excerpt":{"rendered":"<p>SEMINAR IN LOGIC AND GAMES AT CUNY Iterated Regret Minimization: a new solution concept Joe Halpern (Cornell) Friday, December 9, 4:15 PM Room 9205, CUNY Graduate Center Abstract. For some well-known games, such as the Traveler&#8217;s Dilemma or the\u00a0Centipede Game, &hellip; <a href=\"https:\/\/blogs.cuit.columbia.edu\/logic\/?p=344\">Continue reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":495,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":[],"categories":[29],"tags":[],"_links":{"self":[{"href":"https:\/\/blogs.cuit.columbia.edu\/logic\/index.php?rest_route=\/wp\/v2\/posts\/344"}],"collection":[{"href":"https:\/\/blogs.cuit.columbia.edu\/logic\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/blogs.cuit.columbia.edu\/logic\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/blogs.cuit.columbia.edu\/logic\/index.php?rest_route=\/wp\/v2\/users\/495"}],"replies":[{"embeddable":true,"href":"https:\/\/blogs.cuit.columbia.edu\/logic\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=344"}],"version-history":[{"count":18,"href":"https:\/\/blogs.cuit.columbia.edu\/logic\/index.php?rest_route=\/wp\/v2\/posts\/344\/revisions"}],"predecessor-version":[{"id":443,"href":"https:\/\/blogs.cuit.columbia.edu\/logic\/index.php?rest_route=\/wp\/v2\/posts\/344\/revisions\/443"}],"wp:attachment":[{"href":"https:\/\/blogs.cuit.columbia.edu\/logic\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=344"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/blogs.cuit.columbia.edu\/logic\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=344"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/blogs.cuit.columbia.edu\/logic\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=344"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}