Note on the computational complexity of least core concepts for min-cost spanning tree games
Year of publication: |
2000
|
---|---|
Authors: | Faigle, Ulrich ; Kern, Walter ; Paulusma, Daniël |
Published in: |
Mathematical Methods of Operations Research. - Springer. - Vol. 52.2000, 1, p. 23-38
|
Publisher: |
Springer |
Subject: | cooperative game | least core | nucleolus | spanning tree | NP-hard |
-
Note on the computational complexity of least core concepts for min-cost spanning tree games
Faigle, Ulrich, (2000)
-
Weighted nucleoli and dually essential coalitions : (extended version)
Solymosi, Tamás, (2019)
-
Weighted nucleoli and dually essential coalitions (extended version)
Solymosi, Tamás, (2019)
- More ...
-
Note on the computational complexity of least core concepts for min-cost spanning tree games
Faigle, Ulrich, (2000)
-
The stable fixtures problem with payments
Biró, Péter, (2015)
-
Computing Solutions for Matching Games
Biró, Péter, (2011)
- More ...