Bargaining with many players: A limit result
We provide a simple characterization of the stationary subgame perfect equilibrium of an alternating offers bargaining game when the number of players increases without a limit. Core convergence literature is emulated by increasing the number of players by replication. The limit allocation is interpreted in terms of Walrasian market for being the first proposer.
If 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.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kultti Klaus & Vartiainen Hannu, 2007. "Von Neumann-Morgenstern Stable Set Bridges Time-Preferences to the Nash Solution," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 7(1), pages 1-26, November.
- Fishburn, Peter C & Rubinstein, Ariel, 1982. "Time Preference," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 23(3), pages 677-694, October.
- Joseph M. Ostroy & Louis Makowski, 2001. "Perfect Competition and the Creativity of the Market," Journal of Economic Literature, American Economic Association, vol. 39(2), pages 479-535, June.
- Vijay Krishna & Roberto Serrano, 1996. "Multilateral Bargaining," Review of Economic Studies, Oxford University Press, vol. 63(1), pages 61-80.
When requesting a correction, please mention this item's handle: RePEc:eee:ecolet:v:101:y:2008:i:3:p:249-252. 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: (Dana Niculescu)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.