Efficient delays in a stochastic model of bargaining
AbstractWe consider a k-player sequential bargaining model in which both the cake size and the identity of the proposer are determined by a stochastic process. For the case where the cake is a simplex (of random size) and the players share a common discount factor, we establish the existence of a unique stationary subgame perfect payoff which is efficient and characterize the conditions under which agreement is delayed. We also investigate how the equilibrium payoffs depend on the order in which the players move and on the correlation between the identity of the proposer and the cake size.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by Springer in its journal Economic Theory.
Volume (Year): 11 (1997)
Issue (Month): 1 ()
Note: Received: November 5, 1996; revised version: December 31, 1996
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00199/index.htm
Find related papers by JEL classification:
- C73 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Stochastic and Dynamic Games; Evolutionary Games
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.