Characterization sets for the nucleolus |
| |
| Authors: | D Granot F Granot W R Zhu |
| |
| Institution: | (1) Faculty of Commerce and Business Administration, The University of British Columbia, Vancouver, B.C., Canada, V6T 1Z2 (e-mail: daniel.granot@commerce.ubc.ca; frieda.granot@commerce.ubc.ca; Richard_Zhu@sealand.com), CA |
| |
| 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.
Received May 1994/Revised version May 1997/Final version February 1998 |
| |
| Keywords: | : Cooperative game nucleolus strongly polynomial algorithms minimum cost spanning tree games |
| 本文献已被 SpringerLink 等数据库收录！ |
