Leximals, the Lexicore and the Average Lexicographic Value
AbstractThe lexicographic vectors of a balanced game, called here leximals, are used to define a new solution concept, the lexicore, on the cone of balanced games. Properties of the lexicore and its relation with the core on some classes of games are studied. It is shown that on cones of balanced games where the core is additive, the leximals, the lexicore and the Average Lexicographic (AL-)value are additive, too. Further, it turns out that the leximals satisfy a consistency property with respect to a reduced game `a la Davis and Maschler, which implies an average consistency property of the AL-value. Explicit formulas for the AL-value on the class of k-convex games and on the class of balanced almost convex games are provided.
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 2007-97.
Date of creation: 2007
Date of revision:
Contact details of provider:
Web page: http://center.uvt.nl
cooperative games; the core; the AL-value; the Shapley value;
Find related papers by JEL classification:
- C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
This paper has been announced in the following NEP Reports:
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.:
- Potters, Jos & Poos, Rene & Tijs, Stef & Muto, Shigeo, 1989. "Clan games," Games and Economic Behavior, Elsevier, vol. 1(3), pages 275-293, September.
- Peleg, B, 1986. "On the Reduced Game Property and Its Converse," International Journal of Game Theory, Springer, vol. 15(3), pages 187-200.
- Pradeep Dubey & Robert J. Weber, 1977.
"Probabilistic Values for Games,"
Cowles Foundation Discussion Papers
471, Cowles Foundation for Research in Economics, Yale University.
- Ichiishi, Tatsuro, 1981. "Super-modularity: Applications to convex games and to the greedy algorithm for LP," Journal of Economic Theory, Elsevier, vol. 25(2), pages 283-286, October.
- Potters, J.A.M. & Poos, R. & Tijs, S.H. & Muto, S., 1989. "Clan games," Open Access publications from Tilburg University urn:nbn:nl:ui:12-154241, Tilburg University.
- Brânzei, R. & Tijs, S.H., 2001. "Additivity Regions for Solutions in Cooperative Game Theory," Discussion Paper 2001-81, Tilburg University, Center for Economic Research.
- Caprari, E. & Tijs, S.H. & Torre, A., 2008. "Weighted Average Lexicographic Values for Share Sets and Balanced Cooperative Games," Discussion Paper 2008-8, Tilburg University, Center for Economic Research.
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.