<?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"
	>
<channel>
	<title>Comments on: All bets are off: should mediators and negotiators learn lessons from poker players?</title>
	<atom:link href="http://mediationchannel.com/2006/05/31/all-bets-are-off-should-mediators-and-negotiators-learn-lessons-from-poker-players/feed/" rel="self" type="application/rss+xml" />
	<link>http://mediationchannel.com/2006/05/31/all-bets-are-off-should-mediators-and-negotiators-learn-lessons-from-poker-players/</link>
	<description>News and ideas about mediation, negotiation, conflict resolution, and law</description>
	<pubDate>Fri, 25 Jul 2008 08:29:11 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.5.1</generator>
		<item>
		<title>By: michael webster</title>
		<link>http://mediationchannel.com/2006/05/31/all-bets-are-off-should-mediators-and-negotiators-learn-lessons-from-poker-players/#comment-30</link>
		<dc:creator>michael webster</dc:creator>
		<pubDate>Fri, 02 Jun 2006 01:02:00 +0000</pubDate>
		<guid isPermaLink="false">http://mediationchannel.com/2006/05/31/all-bets-are-off-should-mediators-and-negotiators-learn-lessons-from-poker-players/#comment-30</guid>
		<description>Steven Lubet's book will be very valuable to mediators and negotiators.  Even though poker is a zero sum game, every mediator or negotiator faces a zero sum game: can we find the zone of agreement? &lt;br/&gt;&lt;br/&gt;Where Steven's book is valuable, and this is what I concentrated on in my review on bizop.ca, is that every negotiator has to figure out how strong the other party believes his own case is, how strong I believe that the other party's case is, and various permutations of the "recursive reasoning".&lt;br/&gt;&lt;br/&gt;No less an authority than the Nobel Prize Winner Professor Thomas Schelling has also endorsed Lubet's characterization of a lawyer has someone who has to solve the "recursive" reasoning problem &lt;br/&gt;&lt;br/&gt;Poker gives very clear examples of how to solve this strategic thinking.&lt;br/&gt;&lt;br/&gt;Steven Lubet doesn't claim that all lawyers need to know can be learned from poker players, but he does provide clear and compelling examples of how poker players think strategically and his legal examples are enlightening.&lt;br/&gt;&lt;br/&gt;Generally, I  would characterize Steven Lubet's book as a contribution to that part of cognitive science which focuses on the interaction between hueristics and rational thought in decision theory.  And as such it is both unique and valuable.</description>
		<content:encoded><![CDATA[<p>Steven Lubet&#8217;s book will be very valuable to mediators and negotiators.  Even though poker is a zero sum game, every mediator or negotiator faces a zero sum game: can we find the zone of agreement? </p>
<p>Where Steven&#8217;s book is valuable, and this is what I concentrated on in my review on bizop.ca, is that every negotiator has to figure out how strong the other party believes his own case is, how strong I believe that the other party&#8217;s case is, and various permutations of the &#8220;recursive reasoning&#8221;.</p>
<p>No less an authority than the Nobel Prize Winner Professor Thomas Schelling has also endorsed Lubet&#8217;s characterization of a lawyer has someone who has to solve the &#8220;recursive&#8221; reasoning problem </p>
<p>Poker gives very clear examples of how to solve this strategic thinking.</p>
<p>Steven Lubet doesn&#8217;t claim that all lawyers need to know can be learned from poker players, but he does provide clear and compelling examples of how poker players think strategically and his legal examples are enlightening.</p>
<p>Generally, I  would characterize Steven Lubet&#8217;s book as a contribution to that part of cognitive science which focuses on the interaction between hueristics and rational thought in decision theory.  And as such it is both unique and valuable.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
