Linearity of the core correspondence

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Bloch and de Clippel (J Econ Theory 145:2424–2434, 2010) characterized sets of balanced TU-games on which the core correspondence is linear by means of an equivalence relation. We characterize maximal regions on which the core correspondence is linear in four different ways. First, by finitely many linear equalities and inequalities; thus, the core is piecewise linear. Second, maximal linear regions coincide with closures of equivalence classes (in the sense of Bloch and de Clippel) that are maximal w.r.t. set inclusion. Third, maximal linear regions coincide with closures of equivalence classes of full dimension. Fourth, for every extreme point of the core of a game in the interior of a maximal linear region, the collection of tight core inequalities constitutes a basis.

Cite

CITATION STYLE

APA

Pálvölgyi, D., Peters, H., & Vermeulen, D. (2018). Linearity of the core correspondence. International Journal of Game Theory, 47(4), 1159–1167. https://doi.org/10.1007/s00182-017-0604-8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free