Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Note Computing the nucleolus of min-cost spanning tree games is NP-hard

Note Computing the nucleolus of min-cost spanning tree games is NP-hard We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard. The proof uses a reduction from minimum cover problems. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Game Theory Springer Journals

Note Computing the nucleolus of min-cost spanning tree games is NP-hard

Loading next page...
 
/lp/springer-journals/note-computing-the-nucleolus-of-min-cost-spanning-tree-games-is-np-Od05emcVxz

References (13)

Publisher
Springer Journals
Copyright
Copyright © 1998 by Springer-Verlag Berlin Heidelberg
Subject
Economics; Economic Theory/Quantitative Economics/Mathematical Methods; Game Theory, Economics, Social and Behav. Sciences; Behavioral/Experimental Economics; Operation Research/Decision Theory
ISSN
0020-7276
eISSN
1432-1270
DOI
10.1007/s001820050083
Publisher site
See Article on Publisher Site

Abstract

We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard. The proof uses a reduction from minimum cover problems.

Journal

International Journal of Game TheorySpringer Journals

Published: Nov 2, 1998

There are no references for this article.