Add to ORKGVarious 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
Abstract. We consider a one-round two-player network pricing game, the Stackelberg Minimum Spanning ...
AbstractThe minimum spanning tree problem is a classical and well-known combinatorial optimization p...
Abstract A minimum cost spanning tree game is called ultrametric if the cost function on the edges o...
Various least core concepts including the classical least core of cooperative games are discussed. B...
We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard. The...
Various least core concepts including the classical least core of cooperative games are discussed. B...
Abstract: Let N = {1, ... ,n} be a finite set of players and K N the complete graph on the node set ...
LetN = {1,...,n} be a finite set of players andKN the complete graph on the node setN∪{0}. Assume th...
It is a known result that for a minimum cost spanning tree (mcst) game a Core allocation can be dedu...
We consider classes of cooperative games. We show that we can efficiently compute an allocation in t...
We consider classes of cooperative games. We show that we can efficiently compute an allocation in t...
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost sp...
A minimum cost spanning tree game is called ultrametric if the cost function on the edges of the und...
The nucleolus is a well-known solution concept for coalitional games to fairly distribute the total ...
A matching game is a cooperative game defined by a graph G = (N, E). The player set is N and the val...
Abstract. We consider a one-round two-player network pricing game, the Stackelberg Minimum Spanning ...
AbstractThe minimum spanning tree problem is a classical and well-known combinatorial optimization p...
Abstract A minimum cost spanning tree game is called ultrametric if the cost function on the edges o...
Various least core concepts including the classical least core of cooperative games are discussed. B...
We prove that computing the nucleolus of minimum cost spanning tree games is in general NP-hard. The...
Various least core concepts including the classical least core of cooperative games are discussed. B...
Abstract: Let N = {1, ... ,n} be a finite set of players and K N the complete graph on the node set ...
LetN = {1,...,n} be a finite set of players andKN the complete graph on the node setN∪{0}. Assume th...
It is a known result that for a minimum cost spanning tree (mcst) game a Core allocation can be dedu...
We consider classes of cooperative games. We show that we can efficiently compute an allocation in t...
We consider classes of cooperative games. We show that we can efficiently compute an allocation in t...
In this paper we present the Subtraction Algorithm that computes for every classical minimum cost sp...
A minimum cost spanning tree game is called ultrametric if the cost function on the edges of the und...
The nucleolus is a well-known solution concept for coalitional games to fairly distribute the total ...
A matching game is a cooperative game defined by a graph G = (N, E). The player set is N and the val...
Abstract. We consider a one-round two-player network pricing game, the Stackelberg Minimum Spanning ...
AbstractThe minimum spanning tree problem is a classical and well-known combinatorial optimization p...
Abstract A minimum cost spanning tree game is called ultrametric if the cost function on the edges o...