D. Granot () (Faculty of Commerce and Business Administration, The University of British Columbia, Vancouver, B.C., Canada, V6T 1Z2) F. Granot () (Faculty of Commerce and Business Administration, The University of British Columbia, Vancouver, B.C., Canada, V6T 1Z2) W. R. Zhu () (Faculty of Commerce and Business Administration, The University of British Columbia, Vancouver, B.C., Canada, V6T 1Z2)
Abstract
We introduce the concept of a characterization set for the nucleolus of a cooperative game and develop sufficient conditions for a collection of coalitions to form a characterization set thereof. Further, we formalize Kopelowitz's method for computing the nucleolus through the notion of a sequential LP process, and derive a general relationship between the size of a characterization set and the complexity of computing the nucleolus.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. 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.
Cited by: (explanations, 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.)