TY - JOUR
T1 - A noncooperative theory of coalitional bargaining
AU - Chatierjee, Kalyan
AU - Dutia, Bhaskar
AU - Ray, Debraj
AU - Sengupta, Kunal
N1 - Funding Information:
Acknowledgements: We are extremely grateful to Elaine Bennett and Eric van Damme for detailed comments that illustrate an error in a previous version of this paper, and to Ariel Rubinstein for a thorough reading and several suggestions about the exposition. We are also grateful to Ken Binmore, Martin Osborne and Reinhard Selten for helpful comments. Various institutions extended their hospitality at different stages of this work. including the Indian Statistical Institute where we started this research. In particular, Dutta and Ray are grateful for support from the Warshow endowment of Cornell University (summer 1987) and Ray also from CNPq and the Instituto de Matematica Pura e Aplicada, 1989-1990. The Penn State Center for Research in Conflict and Negotiation provided support at various times for Chatterjee, Dutta and Sengupta. Finally, we thank the Editor of the Review and two anonymous referees for comments and suggestions that led to basic changes in our exposition and choice of material for publication.
PY - 1993/4
Y1 - 1993/4
N2 - We explore a sequential offers model of n-person coalitional bargaining with transferable utility and with time discounting. Our focus is on the efficiency properties of stationary equilibrium of strictly super additive games, when the discount factor is sufficiently large; we do, however, consider examples of other games where sub game perfectness alone is employed. It is shown that delay and the formation of inefficient sub coalitions can occur in equilibrium, the latter for some or all orders of proposer. However, efficient stationary equilibrium payoffs converge to a point in the core, as exist an efficient stationary equilibrium payoff vector for sufficiently high 8. This vector converges as f1 to the egalitarian allocation of Dutta and Ray (1989).
AB - We explore a sequential offers model of n-person coalitional bargaining with transferable utility and with time discounting. Our focus is on the efficiency properties of stationary equilibrium of strictly super additive games, when the discount factor is sufficiently large; we do, however, consider examples of other games where sub game perfectness alone is employed. It is shown that delay and the formation of inefficient sub coalitions can occur in equilibrium, the latter for some or all orders of proposer. However, efficient stationary equilibrium payoffs converge to a point in the core, as exist an efficient stationary equilibrium payoff vector for sufficiently high 8. This vector converges as f1 to the egalitarian allocation of Dutta and Ray (1989).
UR - http://www.scopus.com/inward/record.url?scp=0000124252&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0000124252&partnerID=8YFLogxK
U2 - 10.2307/2298067
DO - 10.2307/2298067
M3 - Article
AN - SCOPUS:0000124252
SN - 0034-6527
VL - 60
SP - 463
EP - 477
JO - Review of Economic Studies
JF - Review of Economic Studies
IS - 2
ER -