Showing 1 - 6 of 6
Persistent link: https://www.econbiz.de/10010993383
Let $N=\{ 1,...,n\} $ be a finite set of players and $K_{N}$ the complete graph on the node set $N\cup \{ 0\} $. Assume that the edges of $K_{N}$ have nonnegative weights and associate with each coalition $S\subseteq N$ of players as cost $c(S)$ the weight of a minimal spanning tree on the node...
Persistent link: https://www.econbiz.de/10005155733
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.
Persistent link: https://www.econbiz.de/10005598406
We consider classes of cooperative games. We show that we can efficiently compute an allocation in the intersection of the prekernel and the least core of the game if we can efficiently compute the minimum excess for any given allocation. In the case where the prekernel of the game contains...
Persistent link: https://www.econbiz.de/10005598505
Suppose that the agents of a matching market contact each other randomly and form new pairs if is in their interest. Does such a process always converge to a stable matching if one exists? If so, how quickly? Are some stable matchings more likely to be obtained by this process than others? In...
Persistent link: https://www.econbiz.de/10010993410
Persistent link: https://www.econbiz.de/10005375669