Link Monotonic Allocation Schemes
AbstractA network is a graph where the nodes represent players and the links represent bilateral interaction between the players. A reward game assigns a value to every network on a fixed set of players. An allocation scheme specifies how to distribute the worth of every network among the players. This allocation scheme is link monotonic if extending the network does not decrease the payoff of any player. We characterize the class of reward games that have a link monotonic allocation scheme. Two allocation schemes for reward games are studied, the Myerson allocation scheme and the position allocation scheme, which are both based on allocation rules for communication situations. We introduce two notions of convexity in the setting of reward games and with these notions of convexity we characterize the classes of reward games where the Myerson allocation scheme and the position allocation scheme are link monotonic. As a by-product we find a characterization of the Myerson value and the position value on the class of reward games using potentials.
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 InfoPaper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number 1999-06.
Date of creation: 1999
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
network; reward game; monotonic allocation scheme;
Other versions of this item:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
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.:
- Jackson, Matthew O. & Wolinsky, Asher, 1996.
"A Strategic Model of Social and Economic Networks,"
Journal of Economic Theory,
Elsevier, vol. 71(1), pages 44-74, October.
- Matthew O. Jackson & Asher Wolinsky, 1995. "A Strategic Model of Social and Economic Networks," Discussion Papers 1098R, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Matthew O. Jackson & Asher Wolinsky, 1994. "A Strategic Model of Social and Economic Networks," Discussion Papers 1098, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Jesus Marin Solano & Carlos Rafels Pallarola, 1996. "Convexity versus average convexity: potential, pmas, the shapley value and simple games," Working Papers in Economics 3, Universitat de Barcelona. Espai de Recerca en Economia.
- Hart, Sergiu & Mas-Colell, Andreu, 1989. "Potential, Value, and Consistency," Econometrica, Econometric Society, vol. 57(3), pages 589-614, May.
- Dutta, Bhaskar & Mutuswami, Suresh, 1996.
971, California Institute of Technology, Division of the Humanities and Social Sciences.
- Sprumont, Yves, 1990. "Population monotonic allocation schemes for cooperative games with transferable utility," Games and Economic Behavior, Elsevier, vol. 2(4), pages 378-394, December.
- Borm, P.E.M. & Owen, G. & Tijs, S.H., 1992. "On the position value for communication situations," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154855, Tilburg University.
- Johnson, C. & Gilles, R.P., 1999. "Spatial Social Networks," Discussion Paper 1999-87, Tilburg University, Center for Economic Research.
- Napel, Stefan & Nohn, Andreas & Alonso-Meijide, José Maria, 2012. "Monotonicity of power in weighted voting games with restricted communication," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 247-257.
- Gérard Hamiache, 2011. "Graph monotonic values," Social Choice and Welfare, Springer, vol. 37(2), pages 287-307, July.
- van den Nouweland, Anne & Slikker, Marco, 2012. "An axiomatic characterization of the position value for network situations," Mathematical Social Sciences, Elsevier, vol. 64(3), pages 266-271.
- Slikker, Marco, 2007. "Bidding for surplus in network allocation problems," Journal of Economic Theory, Elsevier, vol. 137(1), pages 493-511, November.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Richard Broekman).
If references are entirely missing, you can add them using this form.