Efficient delays in a stochastic model of bargaining
We 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.
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|
|Order Information:||Web: http://link.springer.de/orders.htm|
When requesting a correction, please mention this item's handle: RePEc:spr:joecth:v:11:y:1997:i:1:p:39-55. 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: (Sonal Shukla)or (Christopher F Baum)
If references are entirely missing, you can add them using this form.