Networks with Group Counterproposals
We study two n-player sequential network formation games with externalities. Link formation is tied to simultaneous transfer selection in a Nash demand like game in each period. Players in groups can counterpropose. We give necessary and sufficient conditions for efficiency in terms of cyclical monotonicity. The n-player group version always yields efficiency.
|Date of creation:||Jul 2008|
|Date of revision:|
|Contact details of provider:|| Postal: Corso Magenta, 63 - 20123 Milan|
Web page: http://www.feem.it/
More information through EDIRC
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.:
- Mutuswami, Suresh & Winter, Eyal, 2002.
"Subscription Mechanisms for Network Formation,"
Journal of Economic Theory,
Elsevier, vol. 106(2), pages 242-264, October.
- MUTUSWAMI, Suresh & WINTER, Eyal, 2000. "Subscription mechanisms for network formation," CORE Discussion Papers 2000020, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Suresh Mutuswami & Eyal Winter, 2001. "Subscription Mechanisms for Network Formation," Discussion Paper Series dp264, The Federmann Center for the Study of Rationality, the Hebrew University, Jerusalem.
- Nash, John, 1950. "The Bargaining Problem," Econometrica, Econometric Society, vol. 18(2), pages 155-162, April.
When requesting a correction, please mention this item's handle: RePEc:fem:femwpa:2008.61. 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: (barbara racah)
If references are entirely missing, you can add them using this form.