Identification of Stochastic Sequential Bargaining Models, Second Version
Stochastic sequential bargaining games (Merlo and Wilson (1995, 1998)) have found wide applications in various fields including political economy and macroeconomics due to their flexibility in explaining delays in reaching an agreement. In this paper, we present new results in nonparametric identification of such models under different scenarios of data availability. First, we give conditions for an observed distribution of players’ decisions and agreed allocations of the surplus, or the "cake", to be rationalized by a sequential bargaining model. We show the common discount rate is identified, provided the surplus is monotonic in unobservable states (USV) given observed ones (OSV). Then the mapping from states to surplus, or the "cake function", is also recovered under appropriate normalizations. Second, when the cake is only observed under agreements, the discount rate and the impact of observable states on the cake can be identified, if the distribution of USV satisfies some exclusion restrictions and the cake is additively separable in OSV and USV. Third, if data only report when an agreement is reached but never report the size of the cake, we propose a simple algorithm that exploits shape restrictions on the cake function and the independence of USV to recover all rationalizable probabilities for agreements under counterfactual state transitions. Numerical examples show the set of rationalizable counterfactual outcomes so recovered can be informative.
|Date of creation:||15 Oct 2009|
|Date of revision:||01 Mar 2010|
|Contact details of provider:|| Postal: |
Web page: http://economics.sas.upenn.edu/pier
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:pen:papers:10-008. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dolly Guarini)
If references are entirely missing, you can add them using this form.