Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

Note on the computational complexity of least core concepts for min-cost spanning tree games.

Faigle, U. and Kern, W. and Paulusma, Daniel (2000) 'Note on the computational complexity of least core concepts for min-cost spanning tree games.', Mathematical methods of operations research., 52 (1). pp. 23-38.

Abstract

Various least core concepts including the classical least core of cooperative games are discussed. By a reduction from minimum cover problems, we prove that computing an element in these least cores is in general NP-hard for minimum cost spanning tree games. As a consequence, computing the nucleolus, the nucleon and the per-capita nucleolus of minimum cost spanning tree games is also NP-hard.

Item Type:Article
Keywords:Cooperative game, Least core, Nucleolus, Spanning tree, NP-hard.
Full text:Full text not available from this repository.
Publisher Web site:http://dx.doi.org/10.1007/s001860000059
Record Created:13 Oct 2009 11:35
Last Modified:02 Apr 2013 16:52

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitterExport: EndNote, Zotero | BibTex
Usage statisticsLook up in GoogleScholar | Find in a UK Library