On the core and f-nucleolus of flow games

Kern, Walter and Paulusma, Daniël (2009) On the core and f-nucleolus of flow games. Mathematics of Operations Research, 34 (4). pp. 981-991. ISSN 0364-765X

PDF
Restricted to UT campus only: Request a copy
312Kb

Abstract:	Using the ellipsoid method, both Deng et al. [Deng, X., Q. Fang, X. Sun. 2006. Finding nucleolus of flow game. Proc. 17th ACM-SIAM Sympos. Discrete Algorithms. ACM Press, New York, 124–131] and Potters et al. [Potters, J., H. Reijnierse, A. Biswas. 2006. The nucleolus of balanced simple flow networks. Games Econom. Behav. 54 205–225] show that the nucleolus of simple flow games (where all edge capacities are equal to one) can be computed in polynomial time. Our main result is a combinatorial method based on eliminating redundant $s-t$ path constraints such that only a polynomial number of constraints remains. This leads to efficient algorithms for computing the core, nucleolus, and nucleon of simple flow games. Deng et al. also prove that computing the nucleolus for (general) flow games is NP-hard. We generalize this by proving that computing the $f$ -nucleolus of flow games is NP-hard for all priority functions $f$ that satisfy $f(A) > 0$ for all coalitions $A$ with worth $v(A) > 0$ (so, including the priority functions corresponding to the nucleolus, nucleon, and per-capita nucleolus).
Item Type:	Article
Copyright:	© 2009 Inform
Faculty:	Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:	Discrete Mathematics and Mathematical Programming (DMMP)
Link to this item:	http://purl.utwente.nl/publications/69386
Official URL:	http://dx.doi.org/10.1287/moor.1090.0405
Export this item as:	BibTeX EndNote HTML Citation Reference Manager

Show download statistics for this publication

Repository Staff Only: item control page