<?xml version="1.0" encoding="iso-8859-1"?><feed version="0.3" xmlns="http://purl.org/atom/ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xml:lang="en">
<title>NAJ Economics</title><link rel="alternate" type="text/html" href="http://www.najecon.org/"/>
<tagline>NAJ Economics</tagline>
<modified>2011-01-27T12:48:38-08:00</modified>
<id>tag:http://www.najecon.org,2011:/</id>
<generator url="http://http://www.najecon.org/">www.dklevine.com</generator>
<copyright>Copyright (c) 2011, Creative Commons</copyright>
<rss version="2.0"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
    xmlns:admin="http://webns.net/mvcb/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:content="http://purl.org/rss/1.0/modules/content/"
 xmlns:creativeCommons="http://backend.userland.com/creativeCommonsRssModule" />
<channel>
<title>NAJ Economics</title>
<link>http://www.najecon.org/</link>
<creativeCommons:license>http://creativecommons.org/licenses/by-nd/2.0/</creativeCommons:license>
<description>NAJ Economics</description>
<dc:language>en-us</dc:language>
<dc:creator>david@dklevine.com</dc:creator>
<dc:rights>Copyright 2011</dc:rights>
<dc:date>2011-01-27T12:48:38-08:00</dc:date>
<admin:generatorAgent rdf:resource="http://http://www.najecon.org"/>
<admin:errorReportsTo rdf:resource="mailto:david@dklevine.com"/>
<sy:updatePeriod>daily</sy:updatePeriod>
<sy:updateFrequency>1</sy:updateFrequency>
<sy:updateBase>2000-01-01T12:00+00:00</sy:updateBase>

<item>
<title>Overcoming Ideological Bias in Elections by Vijay Krishna and John Morgan</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v16.htm</link>
<description>
Imagine that voters care about the quality of the candidate but also lean towards one of the two candidates. With sincere voting the larger party wins - which will be inefficient if they don't care very much and the minority party does. Now take an off-the-rack voter participation model with stochastic participation costs and lots of strategic voters. Because the party that cares more is more willing to incur participation costs they have a better chance of winning. So much so that - amazingly - majority voting gets the outcome exactly right.
</description>
<guid isPermaLink="false">814577000000000501board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Imagine that voters care about the quality of the candidate but also lean towards one of the two candidates. With sincere voting the larger party wins - which will be inefficient if they don't care very much and the minority party does. Now take an off-the-rack voter participation model with stochastic participation costs and lots of strategic voters. Because the party that cares more is more willing to incur participation costs they have a better chance of winning. So much so that - amazingly - majority voting gets the outcome exactly right.
]]></content:encoded>
<dc:subject>Overcoming Ideological Bias in Elections by Vijay Krishna and John Morgan</dc:subject>
<dc:date>2010-09-28T06:38:27-08:00</dc:date>
</item>

<item>
<title>Competitive Markets without Commitment by Nick Netzer and Florian  Scheuer</title>
<dc:creator>Arthur Robson</dc:creator><link>http://www.najecon.org/v15.htm</link>
<description>
This paper shows that a problem that seems very awkward for a benevolent planner is at least ameliorated by means of an unsophisticated invisible hand. Consider a contract between a principal and a risk-averse agent who also subject to moral hazard, so there is a tension between incentives and risk-sharing. In a competitive market counterpart, with no commitment on either side, the outcome generated Pareto dominates the single principal outcome.
</description>
<guid isPermaLink="false">814577000000000465board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper shows that a problem that seems very awkward for a benevolent planner is at least ameliorated by means of an unsophisticated invisible hand. Consider a contract between a principal and a risk-averse agent who also subject to moral hazard, so there is a tension between incentives and risk-sharing. In a competitive market counterpart, with no commitment on either side, the outcome generated Pareto dominates the single principal outcome.
]]></content:encoded>
<dc:subject>Competitive Markets without Commitment by Nick Netzer and Florian  Scheuer</dc:subject>
<dc:date>2010-03-22T12:53:27-08:00</dc:date>
</item>

<item>
<title>Judicial Precedent as a Dynamic Rationale for Axiomatic Bargaining Theory by Marc Fleurbaey and John Roemer</title>
<dc:creator>Debraj Ray</dc:creator><link>http://www.najecon.org/v15.htm</link>
<description>
Suppose that an arbitrator must allocate payoffs at every date from a freshly drawn two-person bargaining problem. She pays a penalty if her allocation at some date violates one of the Nash axioms relative to her past behavior. (Penalties are lower for inconsistencies with the more distant past.)  Conditions are given for penalty-minimizing behavior to converge to the Nash bargaining solution over time.

This working paper opens (by example) a new line that might apply more generally to axiomatic  solution concepts. If successful, it would connect judicial precedent to axiomatic reasoning.
</description>
<guid isPermaLink="false">814577000000000445board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Suppose that an arbitrator must allocate payoffs at every date from a freshly drawn two-person bargaining problem. She pays a penalty if her allocation at some date violates one of the Nash axioms relative to her past behavior. (Penalties are lower for inconsistencies with the more distant past.)  Conditions are given for penalty-minimizing behavior to converge to the Nash bargaining solution over time.

This working paper opens (by example) a new line that might apply more generally to axiomatic  solution concepts. If successful, it would connect judicial precedent to axiomatic reasoning.
]]></content:encoded>
<dc:subject>Judicial Precedent as a Dynamic Rationale for Axiomatic Bargaining Theory by Marc Fleurbaey and John Roemer</dc:subject>
<dc:date>2010-02-01T20:47:39-08:00</dc:date>
</item>

<item>
<title>Revealed Attention by Yusufcan Masatlioglu, Daisuke Nakajima and Erkut Ozbay</title>
<dc:creator>Ran Spiegler</dc:creator><link>http://www.najecon.org/v15.htm</link>
<description>
How can we infer preferences from choices, when the decision maker may be unaware of some of the feasible alternatives? This paper enriches the standard model of rational choice by assuming that the decision maker is characterized by two unobservables: her preferences, and an &quot;attention filter&quot; which reduces every choice set to a &quot;consideration set&quot;, to which preferences are applied. The paper addresses the problem of identifying these two components from observed choices.
</description>
<guid isPermaLink="false">814577000000000413board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
How can we infer preferences from choices, when the decision maker may be unaware of some of the feasible alternatives? This paper enriches the standard model of rational choice by assuming that the decision maker is characterized by two unobservables: her preferences, and an &quot;attention filter&quot; which reduces every choice set to a &quot;consideration set&quot;, to which preferences are applied. The paper addresses the problem of identifying these two components from observed choices.
]]></content:encoded>
<dc:subject>Revealed Attention by Yusufcan Masatlioglu, Daisuke Nakajima and Erkut Ozbay</dc:subject>
<dc:date>2009-12-01T13:01:07-08:00</dc:date>
</item>

<item>
<title>Choice by Sequential Procedures by Jose Apesteguia and Miguel Ballester</title>
<dc:creator>Ran Spiegler</dc:creator><link>http://www.najecon.org/v15.htm</link>
<description>
Consider a decision maker who employs a sequence of incomplete, acyclic preference relations to eliminate alternatives from the choice set, until she reaches a unique element, which is the one she ends up choosing. The paper axiomatizes this procedure and relates it to other methods of rationalizing choice behavior. It also extends a result due to Mariotti and Manzini (2007) showing that a sequentially rationalizable choice function violates IIA only if the preference relation revealed by choices from pairs contains cycles.
</description>
<guid isPermaLink="false">814577000000000407board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Consider a decision maker who employs a sequence of incomplete, acyclic preference relations to eliminate alternatives from the choice set, until she reaches a unique element, which is the one she ends up choosing. The paper axiomatizes this procedure and relates it to other methods of rationalizing choice behavior. It also extends a result due to Mariotti and Manzini (2007) showing that a sequentially rationalizable choice function violates IIA only if the preference relation revealed by choices from pairs contains cycles.
]]></content:encoded>
<dc:subject>Choice by Sequential Procedures by Jose Apesteguia and Miguel Ballester</dc:subject>
<dc:date>2009-12-01T12:48:30-08:00</dc:date>
</item>

<item>
<title>Democratic Peace and Electoral Accountability by Paola Conconi, Nicolas Sahuguet and Maurizio Zanardi</title>
<dc:creator>Matthew O. Jackson</dc:creator><link>http://www.najecon.org/v15.htm</link>
<description>
This paper sheds very interesting new light on the so-called ``democratic peace,'' which refers to the fact that it is extremely rare for two democracies go to war with each other.  The authors show that this is largely correlated with whether or not a democratic leader faces reelection, and that in fact democratic leaders facing term limits act like autocrats.  Thus, incentives for reelection play a large part in explaining the democratic peace.
</description>
<guid isPermaLink="false">814577000000000392board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper sheds very interesting new light on the so-called ``democratic peace,'' which refers to the fact that it is extremely rare for two democracies go to war with each other.  The authors show that this is largely correlated with whether or not a democratic leader faces reelection, and that in fact democratic leaders facing term limits act like autocrats.  Thus, incentives for reelection play a large part in explaining the democratic peace.
]]></content:encoded>
<dc:subject>Democratic Peace and Electoral Accountability by Paola Conconi, Nicolas Sahuguet and Maurizio Zanardi</dc:subject>
<dc:date>2009-11-21T17:55:51-08:00</dc:date>
</item>

<item>
<title>Bayesian Persuasion by Emir Kamenica and Matthew Gentzkow</title>
<dc:creator>Arthur Robson</dc:creator><link>http://www.najecon.org/v14.htm</link>
<description>
A DA who always wishes to convict structures a case to a judge who wishes to do the right thing. The DA can select the forensic tests to perform-- which must be truthfully reported-- such that the judge will rationally convict a larger fraction of those on trial than are actually guilty. This paper breathes new life into Aumann and Maschler's results for repeated games with incomplete information.
</description>
<guid isPermaLink="false">814577000000000372board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
A DA who always wishes to convict structures a case to a judge who wishes to do the right thing. The DA can select the forensic tests to perform-- which must be truthfully reported-- such that the judge will rationally convict a larger fraction of those on trial than are actually guilty. This paper breathes new life into Aumann and Maschler's results for repeated games with incomplete information.
]]></content:encoded>
<dc:subject>Bayesian Persuasion by Emir Kamenica and Matthew Gentzkow</dc:subject>
<dc:date>2009-10-14T21:10:38-08:00</dc:date>
</item>

<item>
<title>Overconfidence by Jean-Pierre Benoit and Juan Dubra</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v14.htm</link>
<description>
It has been firmly established in the experimental laboratory and in survey data that Garrison Keeler is right and everbody thinks that they are above average. It turns out that in a population of rational people with rational expectations and noisy data, this is exactly as theory predicts.
</description>
<guid isPermaLink="false">122247000000002151board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
It has been firmly established in the experimental laboratory and in survey data that Garrison Keeler is right and everbody thinks that they are above average. It turns out that in a population of rational people with rational expectations and noisy data, this is exactly as theory predicts.
]]></content:encoded>
<dc:subject>Overconfidence by Jean-Pierre Benoit and Juan Dubra</dc:subject>
<dc:date>2008-05-05T13:44:52-08:00</dc:date>
</item>

<item>
<title>Kludged by Jeffrey C. Ely</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v14.htm</link>
<description>
Probably we should try to avoid the editors reviewing each others papers - but this one I can't resist. Anyone who has ever written computer code realizes that patches accumulate, and as they accumulate it gets harder to write additional code. Eventually programmers tear the thing apart and start over again, sometimes with good results, sometimes (Microsoft Vista) with catastrophic ones. Evolution of biological organisms is limited to patches - evolutionary processes cannot start all over again at the bottom. This paper works out an explicit evolutionary model. Even with large mutations occuring infinitely often, behavior can be perpetually suboptimal. (My own thought: evolution produced computer programmers, who can start over again.)
</description>
<guid isPermaLink="false">122247000000002047board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Probably we should try to avoid the editors reviewing each others papers - but this one I can't resist. Anyone who has ever written computer code realizes that patches accumulate, and as they accumulate it gets harder to write additional code. Eventually programmers tear the thing apart and start over again, sometimes with good results, sometimes (Microsoft Vista) with catastrophic ones. Evolution of biological organisms is limited to patches - evolutionary processes cannot start all over again at the bottom. This paper works out an explicit evolutionary model. Even with large mutations occuring infinitely often, behavior can be perpetually suboptimal. (My own thought: evolution produced computer programmers, who can start over again.)
]]></content:encoded>
<dc:subject>Kludged by Jeffrey C. Ely</dc:subject>
<dc:date>2008-04-03T14:02:10-08:00</dc:date>
</item>

<item>
<title>The Optimal Multi-Stage Contest by Qiang Fu and JingFeng Lu</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v14.htm</link>
<description>
A Principal wants to maximize productive effort from a group of agents.  The principal has a fixed budget to be allocated as prizes in some contest.  This paper considers a general set of contests that potentially involve multiple knockout stages and analyzes the optimal multi-stage structure as well as the allocation of prizes over time.  The effort-maximizing contest eliminates a single contestant in each period until two remain in the &quot;finale&quot; and reserves all prize money for the winner of the finale.
</description>
<guid isPermaLink="false">843644000000000390board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
A Principal wants to maximize productive effort from a group of agents.  The principal has a fixed budget to be allocated as prizes in some contest.  This paper considers a general set of contests that potentially involve multiple knockout stages and analyzes the optimal multi-stage structure as well as the allocation of prizes over time.  The effort-maximizing contest eliminates a single contestant in each period until two remain in the &quot;finale&quot; and reserves all prize money for the winner of the finale.
]]></content:encoded>
<dc:subject>The Optimal Multi-Stage Contest by Qiang Fu and JingFeng Lu</dc:subject>
<dc:date>2007-08-17T16:47:09-08:00</dc:date>
</item>

<item>
<title>Equilibrium Degeneracy and Reputation Effects by Eduardo Faingold and Yuliy Sannikov</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v14.htm</link>
<description>
This paper examines reputation in continuous time models where a noisy signal of the long-run player follows a diffusion process. Without &quot;KWMR&quot; types the equilibrium is completely degenerate and the long-run player is limited to the static Nash equilibrium payoff. With &quot;KWMR&quot; types the equilibrium is non-degenerate. The key idea is that the length of effective horizon for the &quot;audience&quot; of short-run player(s) is critical. Without &quot;KWMR&quot; types, in continuous time, reaction to the long-run player must occur continuously, and the diffusion is very noisy over short time intervals. With &quot;KWMR&quot; types longer term information matters - a reputation is not won in a day - and over a longer period of time the diffusion is much less noisy.
</description>
<guid isPermaLink="false">843644000000000219board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper examines reputation in continuous time models where a noisy signal of the long-run player follows a diffusion process. Without &quot;KWMR&quot; types the equilibrium is completely degenerate and the long-run player is limited to the static Nash equilibrium payoff. With &quot;KWMR&quot; types the equilibrium is non-degenerate. The key idea is that the length of effective horizon for the &quot;audience&quot; of short-run player(s) is critical. Without &quot;KWMR&quot; types, in continuous time, reaction to the long-run player must occur continuously, and the diffusion is very noisy over short time intervals. With &quot;KWMR&quot; types longer term information matters - a reputation is not won in a day - and over a longer period of time the diffusion is much less noisy.
]]></content:encoded>
<dc:subject>Equilibrium Degeneracy and Reputation Effects by Eduardo Faingold and Yuliy Sannikov</dc:subject>
<dc:date>2007-07-03T08:14:31-08:00</dc:date>
</item>

<item>
<title>Parental Guidance and Supervised Learning by Alessandro Lizzeri and Marciano Siniscalchi</title>
<dc:creator>Matthew O. Jackson</dc:creator><link>http://www.najecon.org/v13.htm</link>
<description>
The authors examine learning in a situation where a parent can guide a child's learning by intervening to eliminate mistakes.  The parent faces a tradeoff between improving short term well-being and slowing learning.  While there are large literatures in psychology and game theory on learning,  examining such guided learning from a formal perspective provides interesting insights regarding the ability of the child, the discount rate, and the parent's intervention.
</description>
<guid isPermaLink="false">843644000000000093board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
The authors examine learning in a situation where a parent can guide a child's learning by intervening to eliminate mistakes.  The parent faces a tradeoff between improving short term well-being and slowing learning.  While there are large literatures in psychology and game theory on learning,  examining such guided learning from a formal perspective provides interesting insights regarding the ability of the child, the discount rate, and the parent's intervention.
]]></content:encoded>
<dc:subject>Parental Guidance and Supervised Learning by Alessandro Lizzeri and Marciano Siniscalchi</dc:subject>
<dc:date>2007-06-02T18:21:47-08:00</dc:date>
</item>

<item>
<title>Contractually Stable Networks by Jean-Francois Caulier, Ana Mauleon and Vincent VAnnetelbosch</title>
<dc:creator>Matthew O. Jackson</dc:creator><link>http://www.najecon.org/v13.htm</link>
<description>
The authors provide a model where utility or productive value depends on how players are partitioned into communities as well as how they are connected in a network.  The results extend notions of stability and value allocations.  While this is still preliminary work, the setting will help our understanding of how individuals maintain relationships of different types at the same time, and how such layered relationships interact in determining social structure.
</description>
<guid isPermaLink="false">843644000000000088board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
The authors provide a model where utility or productive value depends on how players are partitioned into communities as well as how they are connected in a network.  The results extend notions of stability and value allocations.  While this is still preliminary work, the setting will help our understanding of how individuals maintain relationships of different types at the same time, and how such layered relationships interact in determining social structure.
]]></content:encoded>
<dc:subject>Contractually Stable Networks by Jean-Francois Caulier, Ana Mauleon and Vincent VAnnetelbosch</dc:subject>
<dc:date>2007-06-02T18:18:49-08:00</dc:date>
</item>

<item>
<title>Private Monitoring with Infinite Histories by Christopher Phelan and Andrzej Skrzypacz</title>
<dc:creator>Matthew O. Jackson</dc:creator><link>http://www.najecon.org/v13.htm</link>
<description>
This paper uses a clever formulation of a repeated game with private monitoring to develop new techniques for characterizing equilibria.  The authors examine time sequences that are infinite in both directions, so there is no ``starting period.''  This helps in formulating how strategies depend on past history, as it allows for a stationarity not possible in games with a starting period, and allows the authors to examine a class of equilibria playable by finite automata.  This also provides new results into how coordination on past histories map into correlated equilibria.
</description>
<guid isPermaLink="false">843644000000000082board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper uses a clever formulation of a repeated game with private monitoring to develop new techniques for characterizing equilibria.  The authors examine time sequences that are infinite in both directions, so there is no ``starting period.''  This helps in formulating how strategies depend on past history, as it allows for a stationarity not possible in games with a starting period, and allows the authors to examine a class of equilibria playable by finite automata.  This also provides new results into how coordination on past histories map into correlated equilibria.
]]></content:encoded>
<dc:subject>Private Monitoring with Infinite Histories by Christopher Phelan and Andrzej Skrzypacz</dc:subject>
<dc:date>2007-06-02T18:14:37-08:00</dc:date>
</item>

<item>
<title>Mechanism Design with Private Communication by Vianney Dequiedt and David Martimort</title>
<dc:creator>Matthew O. Jackson</dc:creator><link>http://www.najecon.org/v13.htm</link>
<description>
This paper considers a twist on the familiar principal-multiple agent mechanism design environment.  Agents never see any of the other agents' messages to the principal, other than what the principal tells them and the principal can lie.   While one might think this is just a simple enrichment of the usual setting, it ends up with some important implications.   It limits the ability of the principal to make use of information from one agent that is correlated with the type of another agent, because of incentive compatibility constraints.   This restores a continuity of mechanism design in the information structure, and small amounts of correlation no longer have drastic effects.  The mechanisms also have some intuitive features, and take a simpler form than in settings where all messages are verifiable by all agents.
</description>
<guid isPermaLink="false">843644000000000077board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper considers a twist on the familiar principal-multiple agent mechanism design environment.  Agents never see any of the other agents' messages to the principal, other than what the principal tells them and the principal can lie.   While one might think this is just a simple enrichment of the usual setting, it ends up with some important implications.   It limits the ability of the principal to make use of information from one agent that is correlated with the type of another agent, because of incentive compatibility constraints.   This restores a continuity of mechanism design in the information structure, and small amounts of correlation no longer have drastic effects.  The mechanisms also have some intuitive features, and take a simpler form than in settings where all messages are verifiable by all agents.
]]></content:encoded>
<dc:subject>Mechanism Design with Private Communication by Vianney Dequiedt and David Martimort</dc:subject>
<dc:date>2007-06-02T18:10:51-08:00</dc:date>
</item>

<item>
<title>A Dynamic Theory of Public Spending, Taxation and Debt by Marco Battaglini and Stephen Coate</title>
<dc:creator>Jon Levin</dc:creator><link>http://www.najecon.org/v13.htm</link>
<description>
This impressive paper integrates a number of important ideas from public finance, political economy, and macroeconomics. Robert Barro argued nearly thirty years ago that government should use public debt to smooth disortionary taxation over time. Battaglini and Coate depart from Barro's benevolent planner and model the voting process through which taxes, public good provision, pork spending and government borrowing are chosen. They provide a sharp characterization of equilibrium spending, taxation and debt management. Among other results, they show that in time of crisis the government will eschew pork spending and finance public goods with bonds that are paid off slowly as the crisis recedes.
</description>
<guid isPermaLink="false">321307000000000029board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This impressive paper integrates a number of important ideas from public finance, political economy, and macroeconomics. Robert Barro argued nearly thirty years ago that government should use public debt to smooth disortionary taxation over time. Battaglini and Coate depart from Barro's benevolent planner and model the voting process through which taxes, public good provision, pork spending and government borrowing are chosen. They provide a sharp characterization of equilibrium spending, taxation and debt management. Among other results, they show that in time of crisis the government will eschew pork spending and finance public goods with bonds that are paid off slowly as the crisis recedes.
]]></content:encoded>
<dc:subject>A Dynamic Theory of Public Spending, Taxation and Debt by Marco Battaglini and Stephen Coate</dc:subject>
<dc:date>2006-05-11T11:45:55-08:00</dc:date>
</item>

<item>
<title>Sequential Innovation, Patents, and Innovation by James Bessen and Eric Maskin</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v12.htm</link>
<description>
Based on standard theory there should be little or no innovation without patents. Surprisingly, there is little if any empirical evidence that there is more innovation when patenting is possible than when it is not. This paper provides a theory of why this may be the case. It starts with the common observation that patents may inhibit innovation by raising the cost of downstream innovations that build on existing ideas. This is captured in an elegant model of sequential innovation that directs our attention to the features of the market and technology that make patent systems more or less desirable. Of particular importance is the interplay between two forces. On the one hand, private information about the value of a patent prevents existing patent holders from engaging in efficient licensing. On the other hand, if little profit is dissipated through competition then patents provide little additional incentive for innovation.
</description>
<guid isPermaLink="false">321307000000000024board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Based on standard theory there should be little or no innovation without patents. Surprisingly, there is little if any empirical evidence that there is more innovation when patenting is possible than when it is not. This paper provides a theory of why this may be the case. It starts with the common observation that patents may inhibit innovation by raising the cost of downstream innovations that build on existing ideas. This is captured in an elegant model of sequential innovation that directs our attention to the features of the market and technology that make patent systems more or less desirable. Of particular importance is the interplay between two forces. On the one hand, private information about the value of a patent prevents existing patent holders from engaging in efficient licensing. On the other hand, if little profit is dissipated through competition then patents provide little additional incentive for innovation.
]]></content:encoded>
<dc:subject>Sequential Innovation, Patents, and Innovation by James Bessen and Eric Maskin</dc:subject>
<dc:date>2006-05-10T14:21:16-08:00</dc:date>
</item>

<item>
<title>A Theory of Momentum in Sequential Voting by Nageeb Ali and Navin Kartik</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v12.htm</link>
<description>
What explains the intense competition for small early states like New Hampshire and Iowa in US Presidential primary elections?  Presumably, other things equal, winning an early contest increases the chance of winning bigger, later states.  This paper explains how such momentum effects can arise in a strict equilibrium of a sequential common-value election.  Voters update their beliefs about the value of candidates based on the preceding history.  Momentum is similar to an informational cascade.
</description>
<guid isPermaLink="false">321307000000000019board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
What explains the intense competition for small early states like New Hampshire and Iowa in US Presidential primary elections?  Presumably, other things equal, winning an early contest increases the chance of winning bigger, later states.  This paper explains how such momentum effects can arise in a strict equilibrium of a sequential common-value election.  Voters update their beliefs about the value of candidates based on the preceding history.  Momentum is similar to an informational cascade.
]]></content:encoded>
<dc:subject>A Theory of Momentum in Sequential Voting by Nageeb Ali and Navin Kartik</dc:subject>
<dc:date>2006-05-10T13:15:34-08:00</dc:date>
</item>

<item>
<title>Experientia Docet: Professionals Play Minimax in Laboratory Experiments by Ignacio Palacios-Huerta and Oscar Volij</title>
<dc:creator>Matthew O. Jackson</dc:creator><link>http://www.najecon.org/v12.htm</link>
<description>
This is a provacative experimental paper, that contrasts the play of professional soccer players with college students in zero-sum games.  The paper is interesting not only because of the finding that the professionals play much closer to equilibrium than the college students in a game that replicates a soccer penalty kick; but also because it shows that the the professionals play closer to equilibrium than the college students when they play a zero-sum game that none of the subjects is likely to be familiar with.  This not only tells us how important it is to carefully define ``experience'' in experimental settings, and also provides some insight into the transfer of knowledge across strategic settings.
</description>
<guid isPermaLink="false">122247000000001053board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This is a provacative experimental paper, that contrasts the play of professional soccer players with college students in zero-sum games.  The paper is interesting not only because of the finding that the professionals play much closer to equilibrium than the college students in a game that replicates a soccer penalty kick; but also because it shows that the the professionals play closer to equilibrium than the college students when they play a zero-sum game that none of the subjects is likely to be familiar with.  This not only tells us how important it is to carefully define ``experience'' in experimental settings, and also provides some insight into the transfer of knowledge across strategic settings.
]]></content:encoded>
<dc:subject>Experientia Docet: Professionals Play Minimax in Laboratory Experiments by Ignacio Palacios-Huerta and Oscar Volij</dc:subject>
<dc:date>2006-01-13T17:36:58-08:00</dc:date>
</item>

<item>
<title>Bayesian Consistent Prior Selection by Christopher Chambers and Takashi Hayashi</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v12.htm</link>
<description>
The paper is about rules for selecting priors from sets.  Suppose you are given some information which implies that the probability belongs to some (compact, convex) subset. Assume you have a rule that selects from any such set a prior. (The paper extends to rules that select subsets.)

Consider two thought experiments. First, suppose you are given a subset F and your rule selects a prior p from it.
Next, suppose there is some additional piece of data d, and suppose you are given the subset F* where F* is obtained by updating, prior by prior, the elements of F based on d. 
It seems natural to ask that the prior selected from F* is equal to the posterior derived from p based on d. Essentially this would be assuming that your rule for selecting priors is invariant to the order in which you receive information.
There is no rule satisfying this condition.
</description>
<guid isPermaLink="false">784828000000000532board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
The paper is about rules for selecting priors from sets.  Suppose you are given some information which implies that the probability belongs to some (compact, convex) subset. Assume you have a rule that selects from any such set a prior. (The paper extends to rules that select subsets.)

Consider two thought experiments. First, suppose you are given a subset F and your rule selects a prior p from it.
Next, suppose there is some additional piece of data d, and suppose you are given the subset F* where F* is obtained by updating, prior by prior, the elements of F based on d. 
It seems natural to ask that the prior selected from F* is equal to the posterior derived from p based on d. Essentially this would be assuming that your rule for selecting priors is invariant to the order in which you receive information.
There is no rule satisfying this condition.
]]></content:encoded>
<dc:subject>Bayesian Consistent Prior Selection by Christopher Chambers and Takashi Hayashi</dc:subject>
<dc:date>2005-11-02T18:18:03-08:00</dc:date>
</item>

<item>
<title>Optimal Menu of Menus with Self-Control Preferences by Susanna Esteban and Eiichi Miyagawa</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v12.htm</link>
<description>
In the standard model of monopoly pricing with incomplete information, the firm offers a menu of price-quantity pairs.  On the other hand, many real-world tariff schedules consist of a menu of *non-linear* prices.  For example, most cell-phone service plans provide initial minutes at a low marginal price (usually zero) and further quantity at a high price.  This paper shows how this is necessarily part of an optimal tariff schedule for consumers who have self-control preferences.  By adding a steep price for extra minutes to plans targeted for low value consumers, the monopoly relaxes the incentive constraint for high-value consumers.  This is because high-value consumers forsee that if they select the low plan they will be tempted to use extra minutes and pay the high price.
</description>
<guid isPermaLink="false">784828000000000458board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
In the standard model of monopoly pricing with incomplete information, the firm offers a menu of price-quantity pairs.  On the other hand, many real-world tariff schedules consist of a menu of *non-linear* prices.  For example, most cell-phone service plans provide initial minutes at a low marginal price (usually zero) and further quantity at a high price.  This paper shows how this is necessarily part of an optimal tariff schedule for consumers who have self-control preferences.  By adding a steep price for extra minutes to plans targeted for low value consumers, the monopoly relaxes the incentive constraint for high-value consumers.  This is because high-value consumers forsee that if they select the low plan they will be tempted to use extra minutes and pay the high price.
]]></content:encoded>
<dc:subject>Optimal Menu of Menus with Self-Control Preferences by Susanna Esteban and Eiichi Miyagawa</dc:subject>
<dc:date>2005-09-24T19:01:55-08:00</dc:date>
</item>

<item>
<title>Strategic Experimentation in Networks by Yann Bramoulle and Rachel Kranton</title>
<dc:creator>Matthew O. Jackson</dc:creator><link>http://www.najecon.org/v11.htm</link>
<description>
Bramoulle and Kranton study the play of local public goods games when players are linked by a network.  Players derive payoffs from their own and immediate neighbors actions, and the authors discuss applications to experimentation where players learn and benefit from the actions of immediate neighbors, but not indirect neighbors.  Nevertheless, indirect neighbors’ play affect direct neighbors’ choices, as actions are strategic substitutes.  While tractability is a challenge, the authors are able to deduce some interesting patterns of behavior and specialization as a function of network architecture.
</description>
<guid isPermaLink="false">784828000000000420board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Bramoulle and Kranton study the play of local public goods games when players are linked by a network.  Players derive payoffs from their own and immediate neighbors actions, and the authors discuss applications to experimentation where players learn and benefit from the actions of immediate neighbors, but not indirect neighbors.  Nevertheless, indirect neighbors’ play affect direct neighbors’ choices, as actions are strategic substitutes.  While tractability is a challenge, the authors are able to deduce some interesting patterns of behavior and specialization as a function of network architecture.
]]></content:encoded>
<dc:subject>Strategic Experimentation in Networks by Yann Bramoulle and Rachel Kranton</dc:subject>
<dc:date>2005-09-09T17:13:12-08:00</dc:date>
</item>

<item>
<title>On the Existence of Monotone Pure Strategy Equilibria in Bayesian Games by Philip J. Reny</title>
<dc:creator>Matthew O. Jackson</dc:creator><link>http://www.najecon.org/v11.htm</link>
<description>
Phil Reny provides new techniques for proving existence of monotone pure strategy equilibria Bayesian games with multidimensional types and actions.  It clarifies the role of single-crossing, and uses a weaker version than previously employed.  The paper leaves open questions  as it has a continuity assumption that while allowing for a wide variety of games with finite strategy sets, does not admit discontinuous games with continuum action spaces, as in many auction models.   Nevertheless, the set of games covered is of substantial interest and more general than in previous results, the arguments deepen our understanding of what is needed for existence, and the use of contractability is clever and looks like to be useful beyond the current work.
</description>
<guid isPermaLink="false">784828000000000415board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Phil Reny provides new techniques for proving existence of monotone pure strategy equilibria Bayesian games with multidimensional types and actions.  It clarifies the role of single-crossing, and uses a weaker version than previously employed.  The paper leaves open questions  as it has a continuity assumption that while allowing for a wide variety of games with finite strategy sets, does not admit discontinuous games with continuum action spaces, as in many auction models.   Nevertheless, the set of games covered is of substantial interest and more general than in previous results, the arguments deepen our understanding of what is needed for existence, and the use of contractability is clever and looks like to be useful beyond the current work.
]]></content:encoded>
<dc:subject>On the Existence of Monotone Pure Strategy Equilibria in Bayesian Games by Philip J. Reny</dc:subject>
<dc:date>2005-09-09T17:00:25-08:00</dc:date>
</item>

<item>
<title>Noise, Information and the Favorite-Longshot Bias by Marco  Ottaviani and Peter Sorenson</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v11.htm</link>
<description>
In pari-mutuel (i.e. horse race) betting, the payout odds on a horse are determined by the fraction out of the total betting pool wagered on the horse.  There is a well-documented regularity, the favorite-longshot bias:  the odds for longshots overstate, and the odds for favorites understate, the true probability of winning.  This paper provides a simple and elegant explanation based on a model of privately informed bettors.  Because the odds are determined only after betting closes, bettors do not know the payout odds when they bet.  After the betting closes the revelation of odds aggregates information but by then bets cannot be changed.  In particular, those who bet on the horse which turned out to be the longshot realize ex post that the probability of winning is lower than they thought, hence the bias.
</description>
<guid isPermaLink="false">784828000000000400board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
In pari-mutuel (i.e. horse race) betting, the payout odds on a horse are determined by the fraction out of the total betting pool wagered on the horse.  There is a well-documented regularity, the favorite-longshot bias:  the odds for longshots overstate, and the odds for favorites understate, the true probability of winning.  This paper provides a simple and elegant explanation based on a model of privately informed bettors.  Because the odds are determined only after betting closes, bettors do not know the payout odds when they bet.  After the betting closes the revelation of odds aggregates information but by then bets cannot be changed.  In particular, those who bet on the horse which turned out to be the longshot realize ex post that the probability of winning is lower than they thought, hence the bias.
]]></content:encoded>
<dc:subject>Noise, Information and the Favorite-Longshot Bias by Marco  Ottaviani and Peter Sorenson</dc:subject>
<dc:date>2005-09-02T12:10:33-08:00</dc:date>
</item>

<item>
<title>Revenue Comparisons for Auctions when Bidders Have Arbitrary Types by Yeon-Koo Che and Ian Gale</title>
<dc:creator>Jon Levin</dc:creator><link>http://www.najecon.org/v11.htm</link>
<description>
This paper introduces a clever approach to compare the expected revenue from different auction designs, assuming bidders in each auction use symmetric equilibrium strategies. Roughly, the idea is replace each bidder with a twin who is risk-neutral and has a single-dimensional value distribution but whose equilibrium bidding behavior would be the same. The expected revenue from the original auction must equal the second-order statistic of the twin's value distribution. This approach is used to extend the revenue equivalence theorem to discrete value distributions and to greatly generalize the revenue ranking of first and second price auctions with risk-averse bidders.
</description>
<guid isPermaLink="false">784828000000000015board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper introduces a clever approach to compare the expected revenue from different auction designs, assuming bidders in each auction use symmetric equilibrium strategies. Roughly, the idea is replace each bidder with a twin who is risk-neutral and has a single-dimensional value distribution but whose equilibrium bidding behavior would be the same. The expected revenue from the original auction must equal the second-order statistic of the twin's value distribution. This approach is used to extend the revenue equivalence theorem to discrete value distributions and to greatly generalize the revenue ranking of first and second price auctions with risk-averse bidders.
]]></content:encoded>
<dc:subject>Revenue Comparisons for Auctions when Bidders Have Arbitrary Types by Yeon-Koo Che and Ian Gale</dc:subject>
<dc:date>2005-04-19T10:15:14-08:00</dc:date>
</item>

<item>
<title>Axiomatic Justification of Stable Equilibria by Srihari Govindan and Robert Wilson</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v11.htm</link>
<description>
Refinements usually judge equilibria by the plausibility of the beliefs that support them.  This is an extensive form criterion.  On the other hand, a traditional viewpoint is that rationality-based theories of behavior should depend only on the strategic form.  This paper embraces both views.  Invariance, the requirement that solutions depend only on the reduced strategic form, together with a version of backward induction, imply Kohlberg-Mertens stability.
</description>
<guid isPermaLink="false">784828000000000009board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Refinements usually judge equilibria by the plausibility of the beliefs that support them.  This is an extensive form criterion.  On the other hand, a traditional viewpoint is that rationality-based theories of behavior should depend only on the strategic form.  This paper embraces both views.  Invariance, the requirement that solutions depend only on the reduced strategic form, together with a version of backward induction, imply Kohlberg-Mertens stability.
]]></content:encoded>
<dc:subject>Axiomatic Justification of Stable Equilibria by Srihari Govindan and Robert Wilson</dc:subject>
<dc:date>2005-04-17T18:25:16-08:00</dc:date>
</item>

<item>
<title>Discounting and altruism to future decision-makers by Maria Saez-Marti and Jorgen  W. Weibull</title>
<dc:creator>Ted Bergstrom</dc:creator><link>http://www.najecon.org/v10.htm</link>
<description>
Suppose that parents have an altruistic utility function that is a weighted sum of the &quot;selfish&quot; utilities  of their own consumption and that of each of their descendants. Each descendant in turn has such an altruistic utility function.
When can a parent's altruistic utility be written as a positively weighted linear combination of her own selfish utility and the altruistic utilities of her descendants. 
The authors show that there are interesting cases where this cannot be done and where it can be done. They provide remarkably crisp necessary and sufficient conditions for 
when it can be done.
</description>
<guid isPermaLink="false">784828000000000004board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Suppose that parents have an altruistic utility function that is a weighted sum of the &quot;selfish&quot; utilities  of their own consumption and that of each of their descendants. Each descendant in turn has such an altruistic utility function.
When can a parent's altruistic utility be written as a positively weighted linear combination of her own selfish utility and the altruistic utilities of her descendants. 
The authors show that there are interesting cases where this cannot be done and where it can be done. They provide remarkably crisp necessary and sufficient conditions for 
when it can be done.
]]></content:encoded>
<dc:subject>Discounting and altruism to future decision-makers by Maria Saez-Marti and Jorgen  W. Weibull</dc:subject>
<dc:date>2005-04-17T13:01:36-08:00</dc:date>
</item>

<item>
<title>Contracts, Liability Restrictions and Costly Verification by Francesco Squintani</title>
<dc:creator>Ran Spiegler</dc:creator><link>http://www.najecon.org/v10.htm</link>
<description>
This paper is an original attempt to open the black box known as &quot;the court&quot; - specifically, the notion of &quot;verifiability&quot; - in contract theory. Before playing a normal-form game, two players sign a contract that conditions on the outcome of the game. The verifiability constraint is modeled as a partition of the set of outcomes. So far, this description follows Bernheim and Whinston (AER 1998). Squintani takes a step forward and allows for non-product partitions: even when the court can verify a breach of contract, it may be unable to verify who did it. In such cases (assuming individual liability), the players may want to write a &quot;roundabout&quot; contract containing an explicit commitment which the players expect to be violated in equilibrium. Although such a contract is unenforceable, it may dominate all enforceable contracts. Squintani also considers non-partitional verifiability structures and examines conditions for their desirability, in terms of familiar properties of non-partitional information structures.
</description>
<guid isPermaLink="false">172782000000000104board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper is an original attempt to open the black box known as &quot;the court&quot; - specifically, the notion of &quot;verifiability&quot; - in contract theory. Before playing a normal-form game, two players sign a contract that conditions on the outcome of the game. The verifiability constraint is modeled as a partition of the set of outcomes. So far, this description follows Bernheim and Whinston (AER 1998). Squintani takes a step forward and allows for non-product partitions: even when the court can verify a breach of contract, it may be unable to verify who did it. In such cases (assuming individual liability), the players may want to write a &quot;roundabout&quot; contract containing an explicit commitment which the players expect to be violated in equilibrium. Although such a contract is unenforceable, it may dominate all enforceable contracts. Squintani also considers non-partitional verifiability structures and examines conditions for their desirability, in terms of familiar properties of non-partitional information structures.
]]></content:encoded>
<dc:subject>Contracts, Liability Restrictions and Costly Verification by Francesco Squintani</dc:subject>
<dc:date>2005-04-06T06:57:29-08:00</dc:date>
</item>

<item>
<title>Simultaneous Search by Hector Chade and Lones Smith</title>
<dc:creator>Jon Levin</dc:creator><link>http://www.najecon.org/v10.htm</link>
<description>
The authors study the following &quot;college application&quot; problem. A student who assigns different probabilities to getting in to different colleges and faces a per-college cost of application must identify the optimal set of schools to which to submit applications. The paper develops a marginal improvement algorithm to solve for the optimal application portfolio and provides elegant characterization results. The optimal portfolio turns out to be less risky than if applications are made sequentially but more risky than if the student picked the most individually promising schools in order ignoring the portfolio aspect of the problem.
</description>
<guid isPermaLink="false">172782000000000036board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
The authors study the following &quot;college application&quot; problem. A student who assigns different probabilities to getting in to different colleges and faces a per-college cost of application must identify the optimal set of schools to which to submit applications. The paper develops a marginal improvement algorithm to solve for the optimal application portfolio and provides elegant characterization results. The optimal portfolio turns out to be less risky than if applications are made sequentially but more risky than if the student picked the most individually promising schools in order ignoring the portfolio aspect of the problem.
]]></content:encoded>
<dc:subject>Simultaneous Search by Hector Chade and Lones Smith</dc:subject>
<dc:date>2005-03-29T13:40:31-08:00</dc:date>
</item>

<item>
<title>The Folk Theorem for Games with Private, Almost-Perfect Monitoring by Johannes Horner and Wojciech Olszewski</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v10.htm</link>
<description>
This completes a step toward the Folk Thereom for repeated games with private monitoring.  It establishes the result for all n-player games where monitoring is &quot;almost-perfect&quot;  (and the usual dimensionality conditions are satisfied.)  Previous authors had accomplished as much as possible using limited methods to avoid getting their hands dirty.  The quantity of dirt on these authors' hands is impressive.
</description>
<guid isPermaLink="false">172782000000000009board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This completes a step toward the Folk Thereom for repeated games with private monitoring.  It establishes the result for all n-player games where monitoring is &quot;almost-perfect&quot;  (and the usual dimensionality conditions are satisfied.)  Previous authors had accomplished as much as possible using limited methods to avoid getting their hands dirty.  The quantity of dirt on these authors' hands is impressive.
]]></content:encoded>
<dc:subject>The Folk Theorem for Games with Private, Almost-Perfect Monitoring by Johannes Horner and Wojciech Olszewski</dc:subject>
<dc:date>2005-03-25T09:52:31-08:00</dc:date>
</item>

<item>
<title>Art and the Internet: Blessing the Curse? by Patrick Legros</title>
<dc:creator>Michele Boldrin</dc:creator><link>http://www.najecon.org/v10.htm</link>
<description>
Brilliant survey of the field, containing also original work. The boldrin-levine model is extended to model the markets for art. An artist can embody each original idea in m different works of art y(1), ..., y(m). The creativity of an artist is indexed by n, the number of original ideas. Each artist has a fixed capacity k of making works of art, hence he will make s=k/n embodiments for each of his own n ideas. This defines his portfolio. Consumers and artists have access to reproduction technologies. The welfare theorems apply, and are used to derive supporting prices and decentralization mechanisms. He argues that incentive provisions for new creative ideas have little to do, at least in principle, with most of the crying about piracy and in support of copyrights.
</description>
<guid isPermaLink="false">172782000000000003board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Brilliant survey of the field, containing also original work. The boldrin-levine model is extended to model the markets for art. An artist can embody each original idea in m different works of art y(1), ..., y(m). The creativity of an artist is indexed by n, the number of original ideas. Each artist has a fixed capacity k of making works of art, hence he will make s=k/n embodiments for each of his own n ideas. This defines his portfolio. Consumers and artists have access to reproduction technologies. The welfare theorems apply, and are used to derive supporting prices and decentralization mechanisms. He argues that incentive provisions for new creative ideas have little to do, at least in principle, with most of the crying about piracy and in support of copyrights.
]]></content:encoded>
<dc:subject>Art and the Internet: Blessing the Curse? by Patrick Legros</dc:subject>
<dc:date>2005-03-21T17:41:13-08:00</dc:date>
</item>

<item>
<title>Information Transmission with Cheap and Almost-Cheap Talk by Navin Kartik</title>
<dc:creator>Ted Bergstrom</dc:creator><link>http://www.najecon.org/v9.htm</link>
<description>
Consider a signaling model with many equilibria, some of which are more informative than others.  Suppose that truth  is free, but lies are costly.  Then significant information can be transmitted by talk.  So some of the less informative equilibria disappear.  Which equilibria remain in the limiting case as the cost of lying approaches zero?  The paper shows that under &quot;a standard condition&quot;, only the most informative equilibrium of the original model survives.
 (This paper was presented at the Soutwest Economic Theory
Conference in March, 2005.)
</description>
<guid isPermaLink="false">666156000000000652board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Consider a signaling model with many equilibria, some of which are more informative than others.  Suppose that truth  is free, but lies are costly.  Then significant information can be transmitted by talk.  So some of the less informative equilibria disappear.  Which equilibria remain in the limiting case as the cost of lying approaches zero?  The paper shows that under &quot;a standard condition&quot;, only the most informative equilibrium of the original model survives.
 (This paper was presented at the Soutwest Economic Theory
Conference in March, 2005.)
]]></content:encoded>
<dc:subject>Information Transmission with Cheap and Almost-Cheap Talk by Navin Kartik</dc:subject>
<dc:date>2005-03-17T11:35:12-08:00</dc:date>
</item>

<item>
<title>Revealing Preferences for Fairness in Ultimatum Bargaining by James Andreoni, Marco Castillo and Ragan Petrie</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v9.htm</link>
<description>
[Fairness and Reciprocity Special Issue]Part of the controversy over the Fehr/Schmidt (and other) calibrations revolves around the fact that existing ultimatum experiments do not generate enough information to pin down preferences. The correct response to this criticism is to get better data. This study does exactly that by allowing the responder to shrink offers as well as to accept and reject them. The underlying preferences appear to satisfy ordinary convexity and regularity assumptions, but are non-monotonic and fairly heterogeneous across individuals. Reviewed by Jeff Ely, Drew Fudenberg, and David K. Levine
</description>
<guid isPermaLink="false">666156000000000648board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
[Fairness and Reciprocity Special Issue]Part of the controversy over the Fehr/Schmidt (and other) calibrations revolves around the fact that existing ultimatum experiments do not generate enough information to pin down preferences. The correct response to this criticism is to get better data. This study does exactly that by allowing the responder to shrink offers as well as to accept and reject them. The underlying preferences appear to satisfy ordinary convexity and regularity assumptions, but are non-monotonic and fairly heterogeneous across individuals. Reviewed by Jeff Ely, Drew Fudenberg, and David K. Levine
]]></content:encoded>
<dc:subject>Revealing Preferences for Fairness in Ultimatum Bargaining by James Andreoni, Marco Castillo and Ragan Petrie</dc:subject>
<dc:date>2005-03-16T20:46:21-08:00</dc:date>
</item>

<item>
<title>The Canonical Type Space for Interdependent Preferences by Faruk Gul and Wolfgang Pesendorfer</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v9.htm</link>
<description>
[Fairness and Reciprocity Special Issue] An alternative to theories of &quot;fairness&quot; that seem to have a degree of arbitrariness as to what is &quot;fair&quot; are theories of reciprocity in which people want to be kind or cruel based upon their perception of whether their opponent(s) are kind or cruel.  Gul-Pesendorfer provide an axiomatic basis for interpersonal utility that leads to a theory of reciprocity.  As an application they show how their model is consistent with data on the ultimatum game and related experiments. Reviewed by Jeff Ely, Drew Fudenberg, and David K. Levine.
</description>
<guid isPermaLink="false">666156000000000638board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
[Fairness and Reciprocity Special Issue] An alternative to theories of &quot;fairness&quot; that seem to have a degree of arbitrariness as to what is &quot;fair&quot; are theories of reciprocity in which people want to be kind or cruel based upon their perception of whether their opponent(s) are kind or cruel.  Gul-Pesendorfer provide an axiomatic basis for interpersonal utility that leads to a theory of reciprocity.  As an application they show how their model is consistent with data on the ultimatum game and related experiments. Reviewed by Jeff Ely, Drew Fudenberg, and David K. Levine.
]]></content:encoded>
<dc:subject>The Canonical Type Space for Interdependent Preferences by Faruk Gul and Wolfgang Pesendorfer</dc:subject>
<dc:date>2005-03-16T20:39:45-08:00</dc:date>
</item>

<item>
<title>Contracts, Fairness and Incentives by Ernst Fehr, Alexander Klein and Klaus M. Schmidt</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v9.htm</link>
<description>
[Fairness and Reciprocity Special Issue] This is a very recent application of the Fehr-Schmidt methodology.  Experimentally and theoretically it is shown that it is better not to rely soley on either trust or incentives when desiging contracts;  bonus contracts that combine elements of incentives and trust do the best.  Reviewed by Jeff Ely, Drew Fudenberg and David K. Levine.
</description>
<guid isPermaLink="false">666156000000000630board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
[Fairness and Reciprocity Special Issue] This is a very recent application of the Fehr-Schmidt methodology.  Experimentally and theoretically it is shown that it is better not to rely soley on either trust or incentives when desiging contracts;  bonus contracts that combine elements of incentives and trust do the best.  Reviewed by Jeff Ely, Drew Fudenberg and David K. Levine.
]]></content:encoded>
<dc:subject>Contracts, Fairness and Incentives by Ernst Fehr, Alexander Klein and Klaus M. Schmidt</dc:subject>
<dc:date>2005-03-16T20:16:59-08:00</dc:date>
</item>

<item>
<title>Brief Reply by Avner Shaked</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v9.htm</link>
<description>
[Fairness and Reciprocity Special Issue Begins in Previous Volume] Shaked's brief reply takes a less pejorative tone and boils the debate down to one serious concern.  When a researcher selects parameter values for a theoretical model consistent with data from already existing experiments, to what extent has it been shown that the model &quot;explains&quot; the data? Reviewed by Jeff Ely and David K. Levine
</description>
<guid isPermaLink="false">666156000000000623board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
[Fairness and Reciprocity Special Issue Begins in Previous Volume] Shaked's brief reply takes a less pejorative tone and boils the debate down to one serious concern.  When a researcher selects parameter values for a theoretical model consistent with data from already existing experiments, to what extent has it been shown that the model &quot;explains&quot; the data? Reviewed by Jeff Ely and David K. Levine
]]></content:encoded>
<dc:subject>Brief Reply by Avner Shaked</dc:subject>
<dc:date>2005-03-16T20:07:09-08:00</dc:date>
</item>

<item>
<title>The Rhetoric of Inequity Aversion- A Reply by Ernst Fehr and Klaus Schmidt</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v8.htm</link>
<description>
[Fairness and Reciprocity Special Issue] This is the reply to the Shaked &quot;pamphlet&quot; by Fehr and Schmidt. It provides substantive answers to the substantive points raised by Shaked. It points out that the questions about the analytic results arise from a typo not a substantive error, and provides additional insight into why the particular parameter values were chosen for the calibration. Reviewed by Jeff Ely and David K. Levine.[Fairness and Reciprocity Special Issue continued in next volume]
</description>
<guid isPermaLink="false">666156000000000619board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
[Fairness and Reciprocity Special Issue] This is the reply to the Shaked &quot;pamphlet&quot; by Fehr and Schmidt. It provides substantive answers to the substantive points raised by Shaked. It points out that the questions about the analytic results arise from a typo not a substantive error, and provides additional insight into why the particular parameter values were chosen for the calibration. Reviewed by Jeff Ely and David K. Levine.[Fairness and Reciprocity Special Issue continued in next volume]
]]></content:encoded>
<dc:subject>The Rhetoric of Inequity Aversion- A Reply by Ernst Fehr and Klaus Schmidt</dc:subject>
<dc:date>2005-03-16T19:59:43-08:00</dc:date>
</item>

<item>
<title>The Rhetoric of Inequity Aversion by Avner  Shaked</title>
<dc:creator>Ted Bergstrom</dc:creator><link>http://www.najecon.org/v8.htm</link>
<description>
Avner Shaked presents a sharply critical discussion of claims that Ernst Fehr and Klaus Schmidt have made for their 
theory of &quot;inequity aversion&quot; and of the methods that they have used to promote this theory. A vigorous response by  Fehr and Schmidt and a brief rejoinder by Shaked can also be found at the above link.  While Shaked's criticism is directed at Fehr and Schmidt, it raises important issues about the handling of evidence in many branches of economics.
</description>
<guid isPermaLink="false">666156000000000614board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Avner Shaked presents a sharply critical discussion of claims that Ernst Fehr and Klaus Schmidt have made for their 
theory of &quot;inequity aversion&quot; and of the methods that they have used to promote this theory. A vigorous response by  Fehr and Schmidt and a brief rejoinder by Shaked can also be found at the above link.  While Shaked's criticism is directed at Fehr and Schmidt, it raises important issues about the handling of evidence in many branches of economics.
]]></content:encoded>
<dc:subject>The Rhetoric of Inequity Aversion by Avner  Shaked</dc:subject>
<dc:date>2005-03-15T21:26:52-08:00</dc:date>
</item>

<item>
<title>Wishful Thinking in Strategic Environments by Muhamet Yildiz</title>
<dc:creator>Ran Spiegler</dc:creator><link>http://www.najecon.org/v8.htm</link>
<description>
Recently there has been a proliferation of economic models with over-optimistic agents. However, these models have a catch: players have biased beliefs regarding the moves of Nature, yet standard equilibrium analysis implies that they are not allowed to hold biased beliefs regarding other players' moves. Here is an interesting attempt to address this problem. The paper analyzes complete-information games with players who are &quot;wishful thinkers&quot;: they choose not only how to act but also what to believe regarding the opponent's action. Yildiz constructs an epistemic model, in which &quot;rationality in a state&quot; is replaced with &quot;wishful thinking in a state&quot;, and &quot;common knowledge of rationality&quot; is replaced with &quot;common knowledge of wishful thinking&quot;. Yildiz shows that only strategies that are played in Nash equilibrium are consistent with common knowledge of wishful thinking. The only kind of biased beliefs that the model essentially leaves room for is optimism about which Nash equilibrium is going to be played.
</description>
<guid isPermaLink="false">666156000000000600board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Recently there has been a proliferation of economic models with over-optimistic agents. However, these models have a catch: players have biased beliefs regarding the moves of Nature, yet standard equilibrium analysis implies that they are not allowed to hold biased beliefs regarding other players' moves. Here is an interesting attempt to address this problem. The paper analyzes complete-information games with players who are &quot;wishful thinkers&quot;: they choose not only how to act but also what to believe regarding the opponent's action. Yildiz constructs an epistemic model, in which &quot;rationality in a state&quot; is replaced with &quot;wishful thinking in a state&quot;, and &quot;common knowledge of rationality&quot; is replaced with &quot;common knowledge of wishful thinking&quot;. Yildiz shows that only strategies that are played in Nash equilibrium are consistent with common knowledge of wishful thinking. The only kind of biased beliefs that the model essentially leaves room for is optimism about which Nash equilibrium is going to be played.
]]></content:encoded>
<dc:subject>Wishful Thinking in Strategic Environments by Muhamet Yildiz</dc:subject>
<dc:date>2005-03-11T22:58:29-08:00</dc:date>
</item>

<item>
<title>Robust Mechanism Design by Dirk Bergemann and Stephen Morris</title>
<dc:creator>Matthew O. Jackson</dc:creator><link>http://www.najecon.org/v8.htm</link>
<description>
The authors investigate mechanism design in a robust sense:  requiring that the mechanism result in the desired equilibrium outcomes even when a large type space is considered, so that agents beliefs, beliefs about beliefs, etc., are incorporated into types and can vary.   Anything that is ex post implementable is robustly implementable, and the authors identify settings where the converse holds so that these two concepts are equivalent.  The authors also have an interesting companion paper (http://www.econ.yale.edu/%7Esm326/rmd-full.pdf) that looks at the full implementation question (accounting for all equilibria of a mechanism) in the face of such robustness requirements.
</description>
<guid isPermaLink="false">666156000000000596board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
The authors investigate mechanism design in a robust sense:  requiring that the mechanism result in the desired equilibrium outcomes even when a large type space is considered, so that agents beliefs, beliefs about beliefs, etc., are incorporated into types and can vary.   Anything that is ex post implementable is robustly implementable, and the authors identify settings where the converse holds so that these two concepts are equivalent.  The authors also have an interesting companion paper (http://www.econ.yale.edu/%7Esm326/rmd-full.pdf) that looks at the full implementation question (accounting for all equilibria of a mechanism) in the face of such robustness requirements.
]]></content:encoded>
<dc:subject>Robust Mechanism Design by Dirk Bergemann and Stephen Morris</dc:subject>
<dc:date>2005-03-10T15:20:38-08:00</dc:date>
</item>

<item>
<title>Who's Who in Networks. Wanted: the Key Player by Coralio  Ballester, Antoni Calvo-Armengol and Yves Zenou</title>
<dc:creator>Matthew O. Jackson</dc:creator><link>http://www.najecon.org/v8.htm</link>
<description>
The authors provide results linking equilibrium behavior in a game among networked players to social networks-based measures of centrality, providing an interesting bridge between the economics and sociology literatures.  A network of players each picks a level of some activity in a game where there are negative global externalities (competition) and local positive externalities (learning, cooperation, etc.) that come through the network.  This system has feedback effects, and the authors show how equilibrium activity levels can be expressed in terms of a centrality measure from the social networks literature (Bonacich centrality). Besides deriving some comparative statics, the authors show how the centrality index can be used to identify ``key’’ players in terms of their decisions having maximum influence on overall activity.
</description>
<guid isPermaLink="false">666156000000000590board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
The authors provide results linking equilibrium behavior in a game among networked players to social networks-based measures of centrality, providing an interesting bridge between the economics and sociology literatures.  A network of players each picks a level of some activity in a game where there are negative global externalities (competition) and local positive externalities (learning, cooperation, etc.) that come through the network.  This system has feedback effects, and the authors show how equilibrium activity levels can be expressed in terms of a centrality measure from the social networks literature (Bonacich centrality). Besides deriving some comparative statics, the authors show how the centrality index can be used to identify ``key’’ players in terms of their decisions having maximum influence on overall activity.
]]></content:encoded>
<dc:subject>Who's Who in Networks. Wanted: the Key Player by Coralio  Ballester, Antoni Calvo-Armengol and Yves Zenou</dc:subject>
<dc:date>2005-03-10T14:14:35-08:00</dc:date>
</item>

<item>
<title>Untitled by Alvaro Sandroni</title>
<dc:creator>Jeff Ely</dc:creator><link>http://www.najecon.org/v7.htm</link>
<description>
This is the latest word in a fascinating literature on testing expert forecasters.  A forecaster is making probabilistic predictions about the realizations of a stochastic process.  A principal wishes to test these predictions against the observed outcomes to determine whether the forecaster is a true expert or not.  Previous literature had considered &quot;calibration tests&quot; and it is known that even a completely ignorant forecaster can pass any such test.  Here there are literally no restrictions on the type of test and it is shown that an ignorant forecaster can use a mixed forecasting strategy to pass *any* test that a true expert can pass.  The mixed strategy depends on the test, so an open question is whether the principal can improve by randomizing the test and keeping it secret.
Erratum added December 3, 2005: The assertion in (4.1) on p. 7 is not correct, and the main Proposition, Proposition 1, must be viewed as unproven.
</description>
<guid isPermaLink="false">666156000000000461board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This is the latest word in a fascinating literature on testing expert forecasters.  A forecaster is making probabilistic predictions about the realizations of a stochastic process.  A principal wishes to test these predictions against the observed outcomes to determine whether the forecaster is a true expert or not.  Previous literature had considered &quot;calibration tests&quot; and it is known that even a completely ignorant forecaster can pass any such test.  Here there are literally no restrictions on the type of test and it is shown that an ignorant forecaster can use a mixed forecasting strategy to pass *any* test that a true expert can pass.  The mixed strategy depends on the test, so an open question is whether the principal can improve by randomizing the test and keeping it secret.
Erratum added December 3, 2005: The assertion in (4.1) on p. 7 is not correct, and the main Proposition, Proposition 1, must be viewed as unproven.
]]></content:encoded>
<dc:subject>Untitled by Alvaro Sandroni</dc:subject>
<dc:date>2005-02-01T20:50:59-08:00</dc:date>
</item>

<item>
<title>The Concept of Income in a General Equilibrium by J Sefton and M Weale</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v7.htm</link>
<description>
Theorists are rightfully skeptical of national income accounting, recognizing that the arbitrary methods used have no theoretical basis. This paper shows that - if it is done correctly - national income accounting can have a theoretical basis, and income measured to directly correlate with welfare.
</description>
<guid isPermaLink="false">122247000000000847board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Theorists are rightfully skeptical of national income accounting, recognizing that the arbitrary methods used have no theoretical basis. This paper shows that - if it is done correctly - national income accounting can have a theoretical basis, and income measured to directly correlate with welfare.
]]></content:encoded>
<dc:subject>The Concept of Income in a General Equilibrium by J Sefton and M Weale</dc:subject>
<dc:date>2005-01-15T11:19:57-08:00</dc:date>
</item>

<item>
<title>Optimal Voting Schemes with Costly Information Acquisition by Alex Gershkov and Balazs Szentes</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v7.htm</link>
<description>
This is a nice representative of a growing literature on mechanism design when information acquisition is costly. It examines the case of a common objective in a setting where commitment to ex post inefficiency is not practical, and characterizes the optimal mechanism. The optimal mechanism is not a committee, but rather to anonymously and sequentially consult people until a threshold of precision is reached. As a practical matter it can be thought of as a process of getting a second (and third) opinion based on the information in the first (and second) opinion. For incentive reasons, it is best not to let the different &quot;doctors&quot; know that you have consulted with the others.
</description>
<guid isPermaLink="false">122247000000000314board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This is a nice representative of a growing literature on mechanism design when information acquisition is costly. It examines the case of a common objective in a setting where commitment to ex post inefficiency is not practical, and characterizes the optimal mechanism. The optimal mechanism is not a committee, but rather to anonymously and sequentially consult people until a threshold of precision is reached. As a practical matter it can be thought of as a process of getting a second (and third) opinion based on the information in the first (and second) opinion. For incentive reasons, it is best not to let the different &quot;doctors&quot; know that you have consulted with the others.
]]></content:encoded>
<dc:subject>Optimal Voting Schemes with Costly Information Acquisition by Alex Gershkov and Balazs Szentes</dc:subject>
<dc:date>2004-07-20T14:58:49-08:00</dc:date>
</item>

<item>
<title>Fairness and Redistribution by Alberto Alesina and George-Marios Angeletos</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v7.htm</link>
<description>
If wealth is due to luck optimal insurance implies a confiscatory tax is efficient; if wealth is due to effort transfers should be low to encourage effort. But even if wealth is due to effort, if taxes are confiscatory, effort does not generate wealth, only luck does so beliefs that only luck matters will be self-confirming. Alesina and Angeletos use the resulting multiplicity of self-confirming equilibria to reconcile cross-country correlation of perceptions about wealth formation and tax policy.
</description>
<guid isPermaLink="false">122247000000000309board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
If wealth is due to luck optimal insurance implies a confiscatory tax is efficient; if wealth is due to effort transfers should be low to encourage effort. But even if wealth is due to effort, if taxes are confiscatory, effort does not generate wealth, only luck does so beliefs that only luck matters will be self-confirming. Alesina and Angeletos use the resulting multiplicity of self-confirming equilibria to reconcile cross-country correlation of perceptions about wealth formation and tax policy.
]]></content:encoded>
<dc:subject>Fairness and Redistribution by Alberto Alesina and George-Marios Angeletos</dc:subject>
<dc:date>2004-07-20T14:33:36-08:00</dc:date>
</item>

<item>
<title>Price Dispersion, Inflation and Welfare by Allen Head and Alok Kumar</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v7.htm</link>
<description>
This paper introduces prices dispersion into a monetary model. This has two striking consequences: first, inflation effects the variance of prices as well as the level of prices. Second, because price dispersion has an impact on the monopoly power of firms, inflation has unexpected welfare consequences. A mild inflation can be beneficial because it induces more search by consumers and reduces the monopoly power of firms.
</description>
<guid isPermaLink="false">122247000000000244board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper introduces prices dispersion into a monetary model. This has two striking consequences: first, inflation effects the variance of prices as well as the level of prices. Second, because price dispersion has an impact on the monopoly power of firms, inflation has unexpected welfare consequences. A mild inflation can be beneficial because it induces more search by consumers and reduces the monopoly power of firms.
]]></content:encoded>
<dc:subject>Price Dispersion, Inflation and Welfare by Allen Head and Alok Kumar</dc:subject>
<dc:date>2004-06-04T13:47:39-08:00</dc:date>
</item>

<item>
<title>Limited Computational Resources Favor Rationality by Yuval Salant</title>
<dc:creator>Ariel Rubinstein</dc:creator><link>http://www.najecon.org/v6.htm</link>
<description>
The paper presents an approach to computational aspects of choice functions.  Computational complexity is measured
by the number of memory cells needed to carry out a computation.  The main result states that the choice functions which require the least amount of memory are rationalizable while most functions require &quot;much more&quot; memory.

This is a very nice paper written by a very promising young researcher.
</description>
<guid isPermaLink="false">666156000000000084board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
The paper presents an approach to computational aspects of choice functions.  Computational complexity is measured
by the number of memory cells needed to carry out a computation.  The main result states that the choice functions which require the least amount of memory are rationalizable while most functions require &quot;much more&quot; memory.

This is a very nice paper written by a very promising young researcher.
]]></content:encoded>
<dc:subject>Limited Computational Resources Favor Rationality by Yuval Salant</dc:subject>
<dc:date>2003-07-20T05:21:11-08:00</dc:date>
</item>

<item>
<title>Carrot Or Stick: Group Selection and the Evolution of Reciprocal Preferences by Florian  Herold</title>
<dc:creator>Ted Bergstrom</dc:creator><link>http://www.najecon.org/v6.htm</link>
<description>
This paper has the most interesting answer that I have seen to the question:  How could natural selection produce creatures who get angry and bear costs to punish bad behavior even if no repeated encounter is likely?  The paper also proposes an explanation of why some people will bear costs to reward good behavior, even without hope of reciprocity. 
The paper uses   a &quot;haystack model&quot; in which individuals are randomly assembled into groups where they interact  and reproduce.  The number of   offspring that a player has is her payoff  in an n-player prisoners' dilemma game in her group  after account is taken for punishments and rewards.  If there are enough punishers or enough rewarders in a group, it pays everybody in the group to cooperate.   Otherwise they all defect.   The paper shows that with this setup,  there exists an evolutionarily stable equilibrium in which all players are programmed to engage in costly punishment and where everyone therefore cooperates.  It also shows  that there is a polymorphic equilibrium in which some individuals reward cooperation and that there is  no equilibrium in which nobody rewards cooperation.   Here is a glimpse of how a population of costly  punishers can be stable.  If almost everybody in the population at large is a punisher, then in almost all groups, there is a preponderance of punishers and so everybody chooses to cooperate.  So punishers never have to bear the costs of punishing.   The only way that a non-punisher could have a different payoff from a punisher would be if the random matching process puts her in a group of   enough  non-punishers so that everybody in the group plays defect.   The  remarkable  thing that Herold notices is that when non-punishers are rare in the population at large,  the expected payoff to non-punishers will actually be lower  than the expected payoff to  punishers.
</description>
<guid isPermaLink="false">666156000000000075board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper has the most interesting answer that I have seen to the question:  How could natural selection produce creatures who get angry and bear costs to punish bad behavior even if no repeated encounter is likely?  The paper also proposes an explanation of why some people will bear costs to reward good behavior, even without hope of reciprocity. 
The paper uses   a &quot;haystack model&quot; in which individuals are randomly assembled into groups where they interact  and reproduce.  The number of   offspring that a player has is her payoff  in an n-player prisoners' dilemma game in her group  after account is taken for punishments and rewards.  If there are enough punishers or enough rewarders in a group, it pays everybody in the group to cooperate.   Otherwise they all defect.   The paper shows that with this setup,  there exists an evolutionarily stable equilibrium in which all players are programmed to engage in costly punishment and where everyone therefore cooperates.  It also shows  that there is a polymorphic equilibrium in which some individuals reward cooperation and that there is  no equilibrium in which nobody rewards cooperation.   Here is a glimpse of how a population of costly  punishers can be stable.  If almost everybody in the population at large is a punisher, then in almost all groups, there is a preponderance of punishers and so everybody chooses to cooperate.  So punishers never have to bear the costs of punishing.   The only way that a non-punisher could have a different payoff from a punisher would be if the random matching process puts her in a group of   enough  non-punishers so that everybody in the group plays defect.   The  remarkable  thing that Herold notices is that when non-punishers are rare in the population at large,  the expected payoff to non-punishers will actually be lower  than the expected payoff to  punishers.
]]></content:encoded>
<dc:subject>Carrot Or Stick: Group Selection and the Evolution of Reciprocal Preferences by Florian  Herold</dc:subject>
<dc:date>2003-06-28T19:08:40-08:00</dc:date>
</item>

<item>
<title>Building Rational Cooperation by Jim  Andreoni and Larry Samuelson</title>
<dc:creator>Ted Bergstrom</dc:creator><link>http://www.najecon.org/v6.htm</link>
<description>
This paper is a showcase for the way that economic theory can inform laboratory testing and vice versa. Previous experimental results suggest that some (but not all) subjects prefer to cooperate in single-shot prisoners' dilemma iff they believe their opponents will cooperate. The paper presents a neat theory of how a heterogeneous population including some conditional cooperators would behave in a game of twice-repeated prisoners' dilemma. The  theory is tested experimentally and seems to fare well.
</description>
<guid isPermaLink="false">666156000000000071board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper is a showcase for the way that economic theory can inform laboratory testing and vice versa. Previous experimental results suggest that some (but not all) subjects prefer to cooperate in single-shot prisoners' dilemma iff they believe their opponents will cooperate. The paper presents a neat theory of how a heterogeneous population including some conditional cooperators would behave in a game of twice-repeated prisoners' dilemma. The  theory is tested experimentally and seems to fare well.
]]></content:encoded>
<dc:subject>Building Rational Cooperation by Jim  Andreoni and Larry Samuelson</dc:subject>
<dc:date>2003-06-18T17:43:06-08:00</dc:date>
</item>

<item>
<title>Aggregative Public Goods Games by Richard Cornes and Roger Hartley</title>
<dc:creator>Ted Bergstrom</dc:creator><link>http://www.najecon.org/v6.htm</link>
<description>
This paper introduces a clever trick for dealing with games in which each player's utility depends on his own consumption and on the sum of all players' contributions to a &quot;public good&quot;.  The proof greatly simplifies proofs of   known results and seems to be a powerful tool for finding new ones.
</description>
<guid isPermaLink="false">666156000000000064board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper introduces a clever trick for dealing with games in which each player's utility depends on his own consumption and on the sum of all players' contributions to a &quot;public good&quot;.  The proof greatly simplifies proofs of   known results and seems to be a powerful tool for finding new ones.
]]></content:encoded>
<dc:subject>Aggregative Public Goods Games by Richard Cornes and Roger Hartley</dc:subject>
<dc:date>2003-06-17T17:28:34-08:00</dc:date>
</item>

<item>
<title>The Linking of Collective Decisions and Efficiency by Matthew O. Jackson and Hugo F. Sonnenschein</title>
<dc:creator>Thomas R. Palfrey</dc:creator><link>http://www.najecon.org/v6.htm</link>
<description>
In Bayesian mechanism design problems, side payments are the usual way to relax incentive constraints. Without side payments, incentive constraints can be relaxed by linking mechanisms across several such problems. For example, in voting over a single issue individuals cannot express strength of preference, but with multiple issues this can be done by logrolling. The main result in this important paper is that, with many decision problems, if individuals have independent private values across these decisions, incentive constraints can be avoided entirely.  This paper proposes a mechanism for achieving efficiency in the limit by requiring each agent’s reported profile of preferences across all decisions to match the prior distribution. Approximate truthful revelation is incentive compatible in a strong sense. There are many applications of this result.
</description>
<guid isPermaLink="false">666156000000000060board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
In Bayesian mechanism design problems, side payments are the usual way to relax incentive constraints. Without side payments, incentive constraints can be relaxed by linking mechanisms across several such problems. For example, in voting over a single issue individuals cannot express strength of preference, but with multiple issues this can be done by logrolling. The main result in this important paper is that, with many decision problems, if individuals have independent private values across these decisions, incentive constraints can be avoided entirely.  This paper proposes a mechanism for achieving efficiency in the limit by requiring each agent’s reported profile of preferences across all decisions to match the prior distribution. Approximate truthful revelation is incentive compatible in a strong sense. There are many applications of this result.
]]></content:encoded>
<dc:subject>The Linking of Collective Decisions and Efficiency by Matthew O. Jackson and Hugo F. Sonnenschein</dc:subject>
<dc:date>2003-06-14T08:03:02-08:00</dc:date>
</item>

<item>
<title>Addiction and Cue-Conditioned Cognitive Processes by B. D. Bernheim and Antonio Rangel</title>
<dc:creator>Thomas R. Palfrey</dc:creator><link>http://www.najecon.org/v5.htm</link>
<description>
Bernheim and Rangel use facts on drug addiction to motivate an ingenious dynamic model of decision making featuring interactions of two separate cognitive systems, emotion and (rational) cognition. Agents always consume the drug when in a &quot;hot mode&quot;, and may consume in a &quot;cold mode&quot;. Level of addiction is a state variable, which goes up after consumption and goes down after abstention. They characterize the value function and show that for addictive goods it is declining in the state, so rational agents should never intentionally consume. The paper is a showcase piece for behavioral economics. The model is well-grounded in facts about neuroscience and addiction, and leads to interesting and testable empirical predictions with significant welfare implications.
</description>
<guid isPermaLink="false">666156000000000055board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Bernheim and Rangel use facts on drug addiction to motivate an ingenious dynamic model of decision making featuring interactions of two separate cognitive systems, emotion and (rational) cognition. Agents always consume the drug when in a &quot;hot mode&quot;, and may consume in a &quot;cold mode&quot;. Level of addiction is a state variable, which goes up after consumption and goes down after abstention. They characterize the value function and show that for addictive goods it is declining in the state, so rational agents should never intentionally consume. The paper is a showcase piece for behavioral economics. The model is well-grounded in facts about neuroscience and addiction, and leads to interesting and testable empirical predictions with significant welfare implications.
]]></content:encoded>
<dc:subject>Addiction and Cue-Conditioned Cognitive Processes by B. D. Bernheim and Antonio Rangel</dc:subject>
<dc:date>2003-06-14T06:51:16-08:00</dc:date>
</item>

<item>
<title>Beauty Contests, Bubbles and Iterated Expectations in Asset Markets by Franklin Allen, Stephen Morris and Hyun S. Shin</title>
<dc:creator>Drew Fudenberg</dc:creator><link>http://www.najecon.org/v5.htm</link>
<description>
This paper points out that the law of iterated expectations doesn't  apply when averaged over a group of agents. Consequently, in a financial market with short-lived traders, the date 1 price need not equal the date 1 average expectation of the date 3 price: In constrast to representative-agent models, there need not be a martingale representation of the price process.
</description>
<guid isPermaLink="false">391749000000000557board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper points out that the law of iterated expectations doesn't  apply when averaged over a group of agents. Consequently, in a financial market with short-lived traders, the date 1 price need not equal the date 1 average expectation of the date 3 price: In constrast to representative-agent models, there need not be a martingale representation of the price process.
]]></content:encoded>
<dc:subject>Beauty Contests, Bubbles and Iterated Expectations in Asset Markets by Franklin Allen, Stephen Morris and Hyun S. Shin</dc:subject>
<dc:date>2003-04-17T11:56:40-08:00</dc:date>
</item>

<item>
<title>Bounded Memory and Biases in Information Processing by Andrea Wilson</title>
<dc:creator>Drew Fudenberg</dc:creator><link>http://www.najecon.org/v5.htm</link>
<description>
This paper shows that some forms of biases in information processing are consistent with the optimal use of a finite memory.  An infinitely-lived decision maker receives a sequence of signals, after which she must make a decision. The agent has a fixed number of memory states available, and chooses  the updating rule and the map from memory to actions to maximize her expected payoff.   The paper obtains a strikingly sharp characterization of the optimal rule when the agent is likely to observe a great many signals before needing to act.
</description>
<guid isPermaLink="false">234936000000000072board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper shows that some forms of biases in information processing are consistent with the optimal use of a finite memory.  An infinitely-lived decision maker receives a sequence of signals, after which she must make a decision. The agent has a fixed number of memory states available, and chooses  the updating rule and the map from memory to actions to maximize her expected payoff.   The paper obtains a strikingly sharp characterization of the optimal rule when the agent is likely to observe a great many signals before needing to act.
]]></content:encoded>
<dc:subject>Bounded Memory and Biases in Information Processing by Andrea Wilson</dc:subject>
<dc:date>2003-04-17T11:23:43-08:00</dc:date>
</item>

<item>
<title>Buyer Coalition Against Monopolistic Screening: On the Role of Asymmetric Information among Buyers by Doh-Shin Jeon and Domenico Menicucci</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v5.htm</link>
<description>
A monopolist can achieve a degree of price discrimination by allowing consumers to self-select among a menu of alternatives. But what if the consumers collude? This paper establishes the surprising result that the monopolist can do as well in the face of collusion as in its absence. It does so by exploiting the fact that consumers also face asymmetric information.
</description>
<guid isPermaLink="false">506439000000000028board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
A monopolist can achieve a degree of price discrimination by allowing consumers to self-select among a menu of alternatives. But what if the consumers collude? This paper establishes the surprising result that the monopolist can do as well in the face of collusion as in its absence. It does so by exploiting the fact that consumers also face asymmetric information.
]]></content:encoded>
<dc:subject>Buyer Coalition Against Monopolistic Screening: On the Role of Asymmetric Information among Buyers by Doh-Shin Jeon and Domenico Menicucci</dc:subject>
<dc:date>2002-08-26T11:40:09-08:00</dc:date>
</item>

<item>
<title>Persistence in Law-of-One-Price Deviations: Evidence From Micro-Price Data by Mario J. Crucini and Mototsugu Shintani</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v5.htm</link>
<description>
A long-standing puzzle in the theory of exchange rates is that short-term exchange rate variations appear to have a half life of 3-5 years - difficult to explain as a consequence of nominal rigidities. Current thinking is that violations in the law of one price between countries is due to real factors, such as differences in the prices of non-traded inputs (such as land). Crucini and Shintani use prices on 270 goods across 90 countries and 13 US cities to study the long and short-term adjustment of prices. They find strong evidence that there are long-term price differences between cities, but not within the US. On the other hand, adjustment back to these long-term prices following short-term exchange rate shocks is rapid, with a half life of a year or less, both between countries and within the US.
</description>
<guid isPermaLink="false">506439000000000022board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
A long-standing puzzle in the theory of exchange rates is that short-term exchange rate variations appear to have a half life of 3-5 years - difficult to explain as a consequence of nominal rigidities. Current thinking is that violations in the law of one price between countries is due to real factors, such as differences in the prices of non-traded inputs (such as land). Crucini and Shintani use prices on 270 goods across 90 countries and 13 US cities to study the long and short-term adjustment of prices. They find strong evidence that there are long-term price differences between cities, but not within the US. On the other hand, adjustment back to these long-term prices following short-term exchange rate shocks is rapid, with a half life of a year or less, both between countries and within the US.
]]></content:encoded>
<dc:subject>Persistence in Law-of-One-Price Deviations: Evidence From Micro-Price Data by Mario J. Crucini and Mototsugu Shintani</dc:subject>
<dc:date>2002-08-04T12:53:59-08:00</dc:date>
</item>

<item>
<title>Inductive Inference: An Axiomatic Approach by Itzhak  Gilboa and David Schmeidler</title>
<dc:creator>Wolfgang Pesendorfer</dc:creator><link>http://www.najecon.org/v4.htm</link>
<description>
An agent must rank the likelihood of eventualities based on a memory of past cases. For each memory, the agent is assumed to have a complete ranking. The paper provides axioms that yield the following representation: a weight is assigned to each case-eventuality pair and eventualities are ranked according to the sum of their weights (summed over all cases in memory). The key axiom asserts that if for two disjoint memories x is deemed more likely than y then the same ranking holds for the combined memory.
</description>
<guid isPermaLink="false">391749000000000547board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
An agent must rank the likelihood of eventualities based on a memory of past cases. For each memory, the agent is assumed to have a complete ranking. The paper provides axioms that yield the following representation: a weight is assigned to each case-eventuality pair and eventualities are ranked according to the sum of their weights (summed over all cases in memory). The key axiom asserts that if for two disjoint memories x is deemed more likely than y then the same ranking holds for the combined memory.
]]></content:encoded>
<dc:subject>Inductive Inference: An Axiomatic Approach by Itzhak  Gilboa and David Schmeidler</dc:subject>
<dc:date>2002-05-10T14:21:58-08:00</dc:date>
</item>

<item>
<title>Two-Class Voting: A Mechanism for Conflict Resolution? by Ernst Maug and Bilge Yilmaz</title>
<dc:creator>Wolfgang Pesendorfer</dc:creator><link>http://www.najecon.org/v4.htm</link>
<description>
A group of agents must vote on a proposed policy. Agents have private information about the merits of the policy. The paper compares a simple voting rule with a &quot;two-class&quot; voting system. A simple voting rule requires k votes for the policy to be implemented. The two-class system partitions the agents into two groups and specifies a simple voting rule for each group. The policy is implemented if it is approved by both groups. The paper shows that two-class-voting aggregates more information if agents have sufficiently diverse preferences.
</description>
<guid isPermaLink="false">391749000000000539board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
A group of agents must vote on a proposed policy. Agents have private information about the merits of the policy. The paper compares a simple voting rule with a &quot;two-class&quot; voting system. A simple voting rule requires k votes for the policy to be implemented. The two-class system partitions the agents into two groups and specifies a simple voting rule for each group. The policy is implemented if it is approved by both groups. The paper shows that two-class-voting aggregates more information if agents have sufficiently diverse preferences.
]]></content:encoded>
<dc:subject>Two-Class Voting: A Mechanism for Conflict Resolution? by Ernst Maug and Bilge Yilmaz</dc:subject>
<dc:date>2002-05-03T09:33:09-08:00</dc:date>
</item>

<item>
<title>Coalitional Rationalizability by Attila Ambrus</title>
<dc:creator>Drew Fudenberg</dc:creator><link>http://www.najecon.org/v4.htm</link>
<description>
Suppose that whenever it is of mutual interest for a group of players to avoid certain strategies, the members of the group will make an implicit agreement not to play them. This leads to an  iterative procedure of restricting players' beliefs and action choices; the strategies that remain are called  coalitionally rationalizable. In contrast to coalitional solution concepts based on the notion of Nash equilibrium, the set of coalitionally rationalizable strategies is always nonempty.
</description>
<guid isPermaLink="false">391749000000000521board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Suppose that whenever it is of mutual interest for a group of players to avoid certain strategies, the members of the group will make an implicit agreement not to play them. This leads to an  iterative procedure of restricting players' beliefs and action choices; the strategies that remain are called  coalitionally rationalizable. In contrast to coalitional solution concepts based on the notion of Nash equilibrium, the set of coalitionally rationalizable strategies is always nonempty.
]]></content:encoded>
<dc:subject>Coalitional Rationalizability by Attila Ambrus</dc:subject>
<dc:date>2002-03-28T11:26:58-08:00</dc:date>
</item>

<item>
<title>Bad Reputation by Jeffrey Ely and Jusso Valimaki</title>
<dc:creator>Drew Fudenberg</dc:creator><link>http://www.najecon.org/v4.htm</link>
<description>
This paper constructs a striking example of a game played by a long-run player against a sequence of short-run opponents.  When the long-run player is known to be rational, then regardless of the player's discount factor these is an equilibrium that achieves the highest feasible payoff,  while introducing a particular “bad” commitment type lowers the equilibrium payoff of a patient long-run player.  Moreover, holding fixed the probability of the bad type,  the equilibrium payoff of a patient long-run player is lower than its  payoff in a one-time interaction.
</description>
<guid isPermaLink="false">391749000000000517board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper constructs a striking example of a game played by a long-run player against a sequence of short-run opponents.  When the long-run player is known to be rational, then regardless of the player's discount factor these is an equilibrium that achieves the highest feasible payoff,  while introducing a particular “bad” commitment type lowers the equilibrium payoff of a patient long-run player.  Moreover, holding fixed the probability of the bad type,  the equilibrium payoff of a patient long-run player is lower than its  payoff in a one-time interaction.
]]></content:encoded>
<dc:subject>Bad Reputation by Jeffrey Ely and Jusso Valimaki</dc:subject>
<dc:date>2002-03-26T10:13:31-08:00</dc:date>
</item>

<item>
<title>Sequentially Optimal Mechanisms by Vasiliki Skreta</title>
<dc:creator>Michele Boldrin</dc:creator><link>http://www.najecon.org/v4.htm</link>
<description>
You do not renounce selling a good just because the first round of bargaining failed. The literature on auctions under incomplete information assumes you would. If the first round fails, you committ to renounce selling the good forever. Skreta's paper looks at sequential mechanism design without this kind of committment. When designing today's mechanism for selling the good, you cannot commit to tomorrow's mechanism. Hence, the revelation principle cannot be applied. A characterization of the optimal dynamic incentive scheme for two-period problems without committment is provided. After characterizing the seller's problem for arbitrary agent types, the author shows that, in sequential bilateral bargaining, the optimal mechanism is to post a price each period.
</description>
<guid isPermaLink="false">391749000000000490board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
You do not renounce selling a good just because the first round of bargaining failed. The literature on auctions under incomplete information assumes you would. If the first round fails, you committ to renounce selling the good forever. Skreta's paper looks at sequential mechanism design without this kind of committment. When designing today's mechanism for selling the good, you cannot commit to tomorrow's mechanism. Hence, the revelation principle cannot be applied. A characterization of the optimal dynamic incentive scheme for two-period problems without committment is provided. After characterizing the seller's problem for arbitrary agent types, the author shows that, in sequential bilateral bargaining, the optimal mechanism is to post a price each period.
]]></content:encoded>
<dc:subject>Sequentially Optimal Mechanisms by Vasiliki Skreta</dc:subject>
<dc:date>2002-03-05T16:03:28-08:00</dc:date>
</item>

<item>
<title>Can We Really Observe Hyperbolic Discounting? by Jesus Fernandez-Villaverde and Arijit Mukherji</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v3.htm</link>
<description>
Short answer: no. In the presence of uncertainty about future preferences geometric discounting gives rise to exactly the type of &quot;preference reversal&quot; observed in psychology experiments. However, hyperbolic discounting implies a preference for commitment, a preference that is not present in an experiment carefully designed to distinguish the two theories.
</description>
<guid isPermaLink="false">391749000000000481board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Short answer: no. In the presence of uncertainty about future preferences geometric discounting gives rise to exactly the type of &quot;preference reversal&quot; observed in psychology experiments. However, hyperbolic discounting implies a preference for commitment, a preference that is not present in an experiment carefully designed to distinguish the two theories.
]]></content:encoded>
<dc:subject>Can We Really Observe Hyperbolic Discounting? by Jesus Fernandez-Villaverde and Arijit Mukherji</dc:subject>
<dc:date>2002-02-16T17:42:47-08:00</dc:date>
</item>

<item>
<title>Social Choice without Rationality by Gil Kalai</title>
<dc:creator>Ariel Rubinstein</dc:creator><link>http://www.najecon.org/v3.htm</link>
<description>
The power of high-caliber mathematicians is knocking on the doors of Social Choice Theory with some intersting and general results. The paper overviews two involved mathematical results proved by Saharon Shelah and Gil Kalai, which relate to the aggregation of classes of choice functions.  In particular the following is result is discussed: Let C be a class of choice functions which does not contain all choice functions, and which is closed to all permutations of the names of the alternatives. Let F be a function which aggregates profiles of functions in C into C and which satisfies that if all individuals agree on the choice from a set so does the aggregator and that the choice from a set depends only on the individuals' choices from that set.  Then, F must be a &quot;dictatorship&quot;.
</description>
<guid isPermaLink="false">391749000000000457board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
The power of high-caliber mathematicians is knocking on the doors of Social Choice Theory with some intersting and general results. The paper overviews two involved mathematical results proved by Saharon Shelah and Gil Kalai, which relate to the aggregation of classes of choice functions.  In particular the following is result is discussed: Let C be a class of choice functions which does not contain all choice functions, and which is closed to all permutations of the names of the alternatives. Let F be a function which aggregates profiles of functions in C into C and which satisfies that if all individuals agree on the choice from a set so does the aggregator and that the choice from a set depends only on the individuals' choices from that set.  Then, F must be a &quot;dictatorship&quot;.
]]></content:encoded>
<dc:subject>Social Choice without Rationality by Gil Kalai</dc:subject>
<dc:date>2002-01-28T09:31:30-08:00</dc:date>
</item>

<item>
<title>Optimal Indirect and Capital Taxation by Mikhail Golosov, Narayana Kocherlakota and Aleh Tsyvinski</title>
<dc:creator>Susan Athey</dc:creator><link>http://www.najecon.org/v3.htm</link>
<description>
This paper analyzes the classic Mirrlees problem of designing a taxation scheme to provide insurance, when agents' skills are private information.  However, this paper considers a much more general model, where agents' skills may be multidimensional and can follow any stochastic process, and the tax system can be nonlinear and history-dependent.  The paper provides an important and general insight: investment should be discouraged relative to the complete-information solution, because future investment income makes it more costly to provide incentives for truthful revelation.  Thus, the optimal tax scheme has a positive capital income tax.
</description>
<guid isPermaLink="false">391749000000000453board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper analyzes the classic Mirrlees problem of designing a taxation scheme to provide insurance, when agents' skills are private information.  However, this paper considers a much more general model, where agents' skills may be multidimensional and can follow any stochastic process, and the tax system can be nonlinear and history-dependent.  The paper provides an important and general insight: investment should be discouraged relative to the complete-information solution, because future investment income makes it more costly to provide incentives for truthful revelation.  Thus, the optimal tax scheme has a positive capital income tax.
]]></content:encoded>
<dc:subject>Optimal Indirect and Capital Taxation by Mikhail Golosov, Narayana Kocherlakota and Aleh Tsyvinski</dc:subject>
<dc:date>2002-01-10T10:22:51-08:00</dc:date>
</item>

<item>
<title>Testing Threats in Repeated Games by Ran Spiegler</title>
<dc:creator>Ariel Rubinstein</dc:creator><link>http://www.najecon.org/v3.htm</link>
<description>
Two players play a 2X2 repeated game.  Strategies are implemented by automatae. When a player responds to a state of the other machine with an action that is not the one-shot best response, he is deterred by some threat from the other player's machine.  The paper suggests a solution
concept which essentially requires that for any player
(1) if the other player's machine has a recurrent state, the machine will eventually play the best response against it
and
(2) the solution path has the property that a player who does not play the one shot best response will be able to point to an event in the past which shows that the deterring threat exists.  A partial characterization of the solution for repeated chicken and prisoner's dillema and a folk theorem are provided.
</description>
<guid isPermaLink="false">391749000000000447board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Two players play a 2X2 repeated game.  Strategies are implemented by automatae. When a player responds to a state of the other machine with an action that is not the one-shot best response, he is deterred by some threat from the other player's machine.  The paper suggests a solution
concept which essentially requires that for any player
(1) if the other player's machine has a recurrent state, the machine will eventually play the best response against it
and
(2) the solution path has the property that a player who does not play the one shot best response will be able to point to an event in the past which shows that the deterring threat exists.  A partial characterization of the solution for repeated chicken and prisoner's dillema and a folk theorem are provided.
]]></content:encoded>
<dc:subject>Testing Threats in Repeated Games by Ran Spiegler</dc:subject>
<dc:date>2002-01-07T13:29:47-08:00</dc:date>
</item>

<item>
<title>Learning To Play Games In Extensive Form By Valuation by Philippe Jehiel and Dov Samet</title>
<dc:creator>Ariel Rubinstein</dc:creator><link>http://www.najecon.org/v3.htm</link>
<description>
Extensive game theoretic models of reinforcement learning assume that players make their decisions based on their experienced valuation of the extensive game strategies. A new and exciting direction of research is suggested.  Each player evaluates each move separately and chooses the move with the highest valuation. When applied to win-lose games and when the valuation of a move is taken to be the payoff incurred the last time the action was used, a player with a winning strategy always wins. For general payoffs, when the valuation of a move is the average of the payoffs incurred when it was used, and with a small &quot;exploration&quot; probability
the players converge to a subgame perfect equilibrium.
</description>
<guid isPermaLink="false">391749000000000013board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Extensive game theoretic models of reinforcement learning assume that players make their decisions based on their experienced valuation of the extensive game strategies. A new and exciting direction of research is suggested.  Each player evaluates each move separately and chooses the move with the highest valuation. When applied to win-lose games and when the valuation of a move is taken to be the payoff incurred the last time the action was used, a player with a winning strategy always wins. For general payoffs, when the valuation of a move is the average of the payoffs incurred when it was used, and with a small &quot;exploration&quot; probability
the players converge to a subgame perfect equilibrium.
]]></content:encoded>
<dc:subject>Learning To Play Games In Extensive Form By Valuation by Philippe Jehiel and Dov Samet</dc:subject>
<dc:date>2001-12-12T03:14:15-08:00</dc:date>
</item>

<item>
<title>Arms Races and Negotiations by Sandeep Baliga and Tomas Sjostrom</title>
<dc:creator>Ted Bergstrom</dc:creator><link>http://www.najecon.org/v2.htm</link>
<description>
A &quot;solution&quot; to Schelling's burglar's dilemma. Players are randomly matched to play a two-person game where a player's type is private information.  For some low types, defect is dominant strategy, while for higher types &quot;cooperate&quot; is a best response if and only if the probability that one's match cooperates is high enough.  In equilibrium without talk, mutual distrust feeds on itself and all defect; but with pregame cheap talk, there is a remarkable partially separating equilibrium that maintains a good deal of cooperation.
</description>
<guid isPermaLink="false">391749000000000008board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
A &quot;solution&quot; to Schelling's burglar's dilemma. Players are randomly matched to play a two-person game where a player's type is private information.  For some low types, defect is dominant strategy, while for higher types &quot;cooperate&quot; is a best response if and only if the probability that one's match cooperates is high enough.  In equilibrium without talk, mutual distrust feeds on itself and all defect; but with pregame cheap talk, there is a remarkable partially separating equilibrium that maintains a good deal of cooperation.
]]></content:encoded>
<dc:subject>Arms Races and Negotiations by Sandeep Baliga and Tomas Sjostrom</dc:subject>
<dc:date>2001-12-06T13:57:05-08:00</dc:date>
</item>

<item>
<title>Signals, Evolution and the Explanatory Power of Transient Information by Brian  Skyrms</title>
<dc:creator>Ted Bergstrom</dc:creator><link>http://www.najecon.org/v2.htm</link>
<description>
Talk about consumers' surplus; Skyrms shows that in evolutionary dynamic models of games,  talk can be extremely valuable, even though it is cheap.  In games like the stag hunt or Nash bargaining game with multiple Nash equilibria, a cheap talk phase can create new polymorphic equilibria, and change the stability and the basins of attraction of equilibria in the base game.
</description>
<guid isPermaLink="false">391749000000000003board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Talk about consumers' surplus; Skyrms shows that in evolutionary dynamic models of games,  talk can be extremely valuable, even though it is cheap.  In games like the stag hunt or Nash bargaining game with multiple Nash equilibria, a cheap talk phase can create new polymorphic equilibria, and change the stability and the basins of attraction of equilibria in the base game.
]]></content:encoded>
<dc:subject>Signals, Evolution and the Explanatory Power of Transient Information by Brian  Skyrms</dc:subject>
<dc:date>2001-12-04T17:02:02-08:00</dc:date>
</item>

<item>
<title>Instantaneous Gratification by Christopher Harris and David Laibson</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v2.htm</link>
<description>
Worried that hyperbolic discounting is unusable? That there are a continuum of equilibria? This paper gives a clean usable formulation of hyperbolic discounting in continuous time with an illustrative application to a savings problem.
</description>
<guid isPermaLink="false">625018000000000270board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Worried that hyperbolic discounting is unusable? That there are a continuum of equilibria? This paper gives a clean usable formulation of hyperbolic discounting in continuous time with an illustrative application to a savings problem.
]]></content:encoded>
<dc:subject>Instantaneous Gratification by Christopher Harris and David Laibson</dc:subject>
<dc:date>2001-10-26T12:16:26-08:00</dc:date>
</item>

<item>
<title>Repeated Games with Almost-Public Monitoring by George J. Mailath and Stephen Morris</title>
<dc:creator>Susan Athey</dc:creator><link>http://www.najecon.org/v2.htm</link>
<description>
This paper provides positive and interpretable results for repeated games where monitoring is private (i.e. each player privately observes a noisy signal of opponent actions), but close to perfect. The main result shows that if in a (strict) perfect public equilibrium of a game with public monitoring, players condition their behavior only on a finite history, then such an equilibrium also exists in close-by games with private monitoring. The paper gives several instructive examples, illustrating how the restriction on memory implies that players have approximate common knowledge of the state of the game.
</description>
<guid isPermaLink="false">625018000000000260board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper provides positive and interpretable results for repeated games where monitoring is private (i.e. each player privately observes a noisy signal of opponent actions), but close to perfect. The main result shows that if in a (strict) perfect public equilibrium of a game with public monitoring, players condition their behavior only on a finite history, then such an equilibrium also exists in close-by games with private monitoring. The paper gives several instructive examples, illustrating how the restriction on memory implies that players have approximate common knowledge of the state of the game.
]]></content:encoded>
<dc:subject>Repeated Games with Almost-Public Monitoring by George J. Mailath and Stephen Morris</dc:subject>
<dc:date>2001-10-04T22:17:04-08:00</dc:date>
</item>

<item>
<title>Consumption Savings Decisions with Quasi-Geometric Discounting by Per Krusell and Anthony A. Smith, Jr.</title>
<dc:creator>Wolfgang Pesendorfer</dc:creator><link>http://www.najecon.org/v2.htm</link>
<description>
A consumption-savings problem of an infinitely lived consumer with beta-delta preferences is shown to have many Markov perfect equilibria. In particular, the consumer's capital holdings may converge to any point in a wide interval.
</description>
<guid isPermaLink="false">625018000000000254board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
A consumption-savings problem of an infinitely lived consumer with beta-delta preferences is shown to have many Markov perfect equilibria. In particular, the consumer's capital holdings may converge to any point in a wide interval.
]]></content:encoded>
<dc:subject>Consumption Savings Decisions with Quasi-Geometric Discounting by Per Krusell and Anthony A. Smith, Jr.</dc:subject>
<dc:date>2001-10-02T13:21:06-08:00</dc:date>
</item>

<item>
<title>Participation Externalities and Asset Price Volatility by Helios Herrera</title>
<dc:creator>Michele Boldrin</dc:creator><link>http://www.najecon.org/v1.htm</link>
<description>
Common wisdom and previous literature argue that, due to a law of large number effect, increasing participation decreases price volatility. Available evidence suggests the opposite is true. The model developed here reconciles theory with facts. Key assumptions are: (i) exogenous fixed cost of entry and, (ii) heterogeneity in risk aversion. In equilibrium new entrants are more risk averse than people already in the market. Hence their participation increases the volatility of supporting prices.
</description>
<guid isPermaLink="false">625018000000000244board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Common wisdom and previous literature argue that, due to a law of large number effect, increasing participation decreases price volatility. Available evidence suggests the opposite is true. The model developed here reconciles theory with facts. Key assumptions are: (i) exogenous fixed cost of entry and, (ii) heterogeneity in risk aversion. In equilibrium new entrants are more risk averse than people already in the market. Hence their participation increases the volatility of supporting prices.
]]></content:encoded>
<dc:subject>Participation Externalities and Asset Price Volatility by Helios Herrera</dc:subject>
<dc:date>2001-09-24T15:54:50-08:00</dc:date>
</item>

<item>
<title>The Long March of History: Farm Laborers Wages in England 1208-1850 by Gregory  Clark</title>
<dc:creator>Michele Boldrin</dc:creator><link>http://www.najecon.org/v1.htm</link>
<description>
In which it is once again shown, on the basis of reliable historical records, that the idea of a long economic stagnation until the miracle of the industrial revolution is quite incorrect. Growth in labor productivity comes from far back in human history, and this is true even for England.
</description>
<guid isPermaLink="false">625018000000000240board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
In which it is once again shown, on the basis of reliable historical records, that the idea of a long economic stagnation until the miracle of the industrial revolution is quite incorrect. Growth in labor productivity comes from far back in human history, and this is true even for England.
]]></content:encoded>
<dc:subject>The Long March of History: Farm Laborers Wages in England 1208-1850 by Gregory  Clark</dc:subject>
<dc:date>2001-09-24T15:48:20-08:00</dc:date>
</item>

<item>
<title>Costly Voting by Tilman  Börgers</title>
<dc:creator>Wolfgang Pesendorfer</dc:creator><link>http://www.najecon.org/v1.htm</link>
<description>
Should voting be mandatory or voluntary? The paper shows that voluntary voting Pareto dominates in a symmetric environment with costly voting.
</description>
<guid isPermaLink="false">625018000000000234board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
Should voting be mandatory or voluntary? The paper shows that voluntary voting Pareto dominates in a symmetric environment with costly voting.
]]></content:encoded>
<dc:subject>Costly Voting by Tilman  Börgers</dc:subject>
<dc:date>2001-09-24T07:42:46-08:00</dc:date>
</item>

<item>
<title>Two Competing Models of How People Learn in Games by Ed Hopkins</title>
<dc:creator>Drew Fudenberg</dc:creator><link>http://www.najecon.org/v1.htm</link>
<description>
This paper shows that the steady states and local stability properties of stochastic fictitious play and reinforcement learning are very similar. Apparent evidence to the contrary provided by Erev and Roth had ignored the way that the noise terms in reinforcement learning can push the steady states away from the Nash equilibria of the unperturbed game.
</description>
<guid isPermaLink="false">625018000000000228board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
This paper shows that the steady states and local stability properties of stochastic fictitious play and reinforcement learning are very similar. Apparent evidence to the contrary provided by Erev and Roth had ignored the way that the noise terms in reinforcement learning can push the steady states away from the Nash equilibria of the unperturbed game.
]]></content:encoded>
<dc:subject>Two Competing Models of How People Learn in Games by Ed Hopkins</dc:subject>
<dc:date>2001-09-21T11:38:53-08:00</dc:date>
</item>

<item>
<title>Is it 'Economics and Psychology'?: The Case of Hyperbolic Discounting by Ariel Rubinstein</title>
<dc:creator>David K. Levine</dc:creator><link>http://www.najecon.org/v1.htm</link>
<description>
If you have never heard of hyperbolic discounting, if you have heard that economics is all screwed up because it has been proven that in reality people use hyperbolic rather than exponential discounting, or if you are just wondering what the fuss is all about, this is the paper to read.
</description>
<guid isPermaLink="false">625018000000000221board4@http://www.dklevine.com/</guid>
<content:encoded><![CDATA[
If you have never heard of hyperbolic discounting, if you have heard that economics is all screwed up because it has been proven that in reality people use hyperbolic rather than exponential discounting, or if you are just wondering what the fuss is all about, this is the paper to read.
]]></content:encoded>
<dc:subject>Is it 'Economics and Psychology'?: The Case of Hyperbolic Discounting by Ariel Rubinstein</dc:subject>
<dc:date>2001-09-21T09:57:08-08:00</dc:date>
</item>

</channel>
</rss>