| Article ID: | iaor2000384 |
| Country: | Germany |
| Volume: | 27 |
| Issue: | 3 |
| Start Page Number: | 359 |
| End Page Number: | 374 |
| Publication Date: | Jan 1998 |
| Journal: | International Journal of Game Theory |
| Authors: | Granot D., Zhu W.R., Granot F. |
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.