2015
DOI: 10.1007/s00186-015-0494-0
|View full text |Cite
|
Sign up to set email alerts
|

The equity core and the Lorenz-maximal allocations in the equal division core

Abstract: In this paper, we characterize the non-emptiness of the equity core (Selten, 1978) and provide a method, easy to implement, for computing the Lorenz-maximal allocations in the equal division core (Dutta-Ray, 1991). Both results are based on a geometrical decomposition of the equity core as a finite union of polyhedrons.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 13 publications
0
3
0
Order By: Relevance
“…From (10) and (11) it follows that x |N \{i} satisfies the conditions stated in Theorem 1 (w.r.t. π ).…”
Section: Axiomatic Characterizationsmentioning
confidence: 88%
See 1 more Smart Citation
“…From (10) and (11) it follows that x |N \{i} satisfies the conditions stated in Theorem 1 (w.r.t. π ).…”
Section: Axiomatic Characterizationsmentioning
confidence: 88%
“…That is, σ 3 chooses the Lorenz maximal allocations in the imputation set. Llerena and Mauri (2015) show that this solution is single-valued and Lorenz dominates all core elements. Then, σ 3 satisfies individual rationality, internal Lorenz stability, external Lorenz stability (over the core), but not weak max consistency.…”
Section: Definition 4 the Egalitarian Core Of A Balanced Gamementioning
confidence: 89%
“…Remark 5.5. For convex games in continuous variables, the Lorenz stable set is characterized by the Davis-Maschler reduced game property and the constrained egalitarianism (e.g., Arin-Inarra [1]) and, on the domain of essential games, the only single-valued solution satisfying the constrained egalitarianism and the projection consistency * is the Lorenz stable set [31]. Axiomatic characterizations of the Lorenz stable set in discrete convex games remains unsolved in our paper.…”
Section: Claimmentioning
confidence: 98%