Showing 63,001 - 63,010 of 63,678
-1. We propose an algorithm that computes the nucleolus of an n-player peer group game in O(n2) time directly from the …
Persistent link: https://www.econbiz.de/10011090844
algorithms have been implemented in a standardized manner in the open source environment R. In most sit- uations, the algorithm …
Persistent link: https://www.econbiz.de/10011091113
Persistent link: https://www.econbiz.de/10011091292
In this paper we consider spanning tree problems, where n players want to be connected to a source as cheap as possible. We introduce and analyze (n!) vertex oriented construct and charge procedures for such spanning tree situations leading in n steps to a minimum cost spanning tree and a cost...
Persistent link: https://www.econbiz.de/10011091850
Persistent link: https://www.econbiz.de/10011092027
AMS classifications: 90C33, 90C26, 91B50.
Persistent link: https://www.econbiz.de/10011092187
costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition …
Persistent link: https://www.econbiz.de/10011092611
Persistent link: https://www.econbiz.de/10011092721
a simple algorithm to compute the nucleolus of airport profit games.In addition we prove that there exists an unique …
Persistent link: https://www.econbiz.de/10011092938
Persistent link: https://www.econbiz.de/10011092984