On a class of vertices of the core

Abstract : It is known that for supermodular TU-games, the vertices of the core are the marginal vectors, and this result remains true for games where the set of feasible coalitions is a distributive lattice. Such games are induced by a hierarchy (partial ordre) on players. We propose a larger class of vertices for games on distributive lattices, called min-max vertices, obtained by minimizing or maximizing in a given order the coordinates of a core element. We give a simple formula which does not need to solve an optimization problem to compute these vertices, valid for connected hierarchies and for the general case under some restrictions. We find under which conditions two different orders induce the same vertex for every game, and show that there exist balanced games whose core has vertices which are not min-max vertices if and only if n > 4.
Document type :
Other publications
Complete list of metadatas

Cited literature [26 references]  Display  Hide  Download

https://halshs.archives-ouvertes.fr/halshs-01411947
Contributor : Lucie Label <>
Submitted on : Wednesday, December 7, 2016 - 5:16:46 PM
Last modification on : Friday, August 23, 2019 - 3:20:03 PM
Long-term archiving on : Monday, March 20, 2017 - 10:43:46 PM

File

16077.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : halshs-01411947, version 1

Collections

Citation

Michel Grabisch, Peter Sudhölter. On a class of vertices of the core. 2016. ⟨halshs-01411947⟩

Share

Metrics

Record views

79

Files downloads

112