In this paper we construct sets of marginal vectors of a TU game with the property that if the marginal vectors from these sets are core elements, then the game is convex.This approach leads to new upperbounds on the number of marginal vectors needed to characterize convexity.An other result is that the relative number of marginals needed to characterize convexity converges to zero.
|Place of Publication||Tilburg|
|Number of pages||8|
|Publication status||Published - 2002|
|Name||CentER Discussion Paper|
- game theory
- marginal vectors