getkCover returns the k-cover for a given TU game according to the formula on p. 173 in the book by Driessen. Note that the k-cover does not exist if condition (7.2) on p. 173 in the book by Driessen is not satisfied.
Numeric vector of length 2^n - 1 representing the values of the coalitions of a TU game with n players
An integer specifying k in the k-cover
numeric vector containing the k-cover of the given game if the k-cover exists, NULL otherwise
Jochen Staudacher email@example.com
Driessen T. (1998) Cooperative Games, Solutions and Applications, Springer, p. 173
1 2 3 4 5 6 7 8 9
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.