On the computation of the nucleolus of a cooperative game
AbstractWe consider classes of cooperative games. We show that we can efficiently compute an allocation in the intersection of the prekernel and the least core of the game if we can efficiently compute the minimum excess for any given allocation. In the case where the prekernel of the game contains exactly one core vector, our algorithm computes the nucleolus of the game. This generalizes both a recent result by Kuipers on the computation of the nucleolus for convex games and a classical result by Megiddo on the nucleolus of standard tree games to classes of more general minimum cost spanning tree games. Our algorithm is based on the ellipsoid method and Maschler's scheme for approximating the prekernel.
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.
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.
Bibliographic InfoArticle provided by Springer in its journal International Journal of Game Theory.
Volume (Year): 30 (2001)
Issue (Month): 1 ()
Note: Received February 2000/Final version April 2001
Contact details of provider:
Web page: http://link.springer.de/link/service/journals/00182/index.htm
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Guajardo, Mario & Jörnsten, Kurt, 2014. "Common Mistakes in Computing the Nucleolus," Discussion Papers 2014/15, Department of Business and Management Science, Norwegian School of Economics.
- Drechsel, J. & Kimms, A., 2010. "Computing core allocations in cooperative games with an application to cooperative procurement," International Journal of Production Economics, Elsevier, vol. 128(1), pages 310-321, November.
- Ulrich Faigle & Walter Kern & Jeroen Kuipers, 2006. "Computing an Element in the Lexicographic Kernel of a Game," Computational Statistics, Springer, vol. 63(3), pages 427-433, July.
- Kimms, Alf & Çetiner, Demet, 2012. "Approximate nucleolus-based revenue sharing in airline alliances," European Journal of Operational Research, Elsevier, vol. 220(2), pages 510-521.
- Cesco, Juan Carlos, 2008. "A general characterization for non-balanced games in terms of U-cycles," European Journal of Operational Research, Elsevier, vol. 191(2), pages 409-415, December.
- Granot, Daniel & Hamers, Herbert & Kuipers, Jeroen & Maschler, Michael, 2011. "On Chinese postman games where residents of each road pay the cost of their road," Games and Economic Behavior, Elsevier, vol. 72(2), pages 427-438, June.
- A. Palestini & G. Pignataro, 2013. "A multi-factor inequality approach to a transfer scheme: the case of Common Agricultural Policy," Working Papers wp891, Dipartimento Scienze Economiche, Universita' di Bologna.
- Péter Biró & Walter Kern & Daniël Paulusma, 2012.
"Computing solutions for matching games,"
International Journal of Game Theory,
Springer, vol. 41(1), pages 75-90, February.
- Kuipers, Jeroen & Mosquera, Manuel A. & Zarzuelo, José M., 2013. "Sharing costs in highways: A game theoretic approach," European Journal of Operational Research, Elsevier, vol. 228(1), pages 158-168.
- Takuya Masuzawa, 2008. "Computing the cores of strategic games with punishment–dominance relations," International Journal of Game Theory, Springer, vol. 37(2), pages 185-201, June.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Guenther Eichhorn) or (Christopher F Baum).
If references are entirely missing, you can add them using this form.