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 order) 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.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02043275
Contributor : Michel Grabisch <>
Submitted on : Wednesday, February 20, 2019 - 7:08:57 PM
Last modification on : Tuesday, March 26, 2019 - 1:27:53 AM

File

vertices-core3.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Michel Grabisch, Peter Sudhölter. On a class of vertices of the core. Games and Economic Behavior, Elsevier, 2018, 108, pp.541-557. ⟨10.1016/j.geb.2017.09.001⟩. ⟨hal-02043275⟩

Share

Metrics

Record views

24

Files downloads

47