Computing the Nucleolus of Min-Cost Spanning Tree Games is Np-Hard
| Year of publication: |
1998
|
|---|---|
| Authors: | Faigle, Ulrich ; Kern, Walter ; Kuipers, Jeroen |
| Publisher: |
[S.l.] : SSRN |
| Subject: | Spieltheorie | Game theory | Core | Kooperatives Spiel | Cooperative game | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
| Description of contents: |
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
Abstract [papers.ssrn.com]
|
| Extent: | 1 Online-Ressource |
|---|---|
| Type of publication: | Book / Working Paper |
| Language: | English |
| Notes: | In: International Journal of Game Theory, Vol. 27, Iss. 3, November 2, 1998 Volltext nicht verfügbar |
| Classification: | C70 - Game Theory and Bargaining Theory. General |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://ebvufind01.dmz1.zbw.eu/10014208679