2023
DOI: 10.1007/s10726-023-09832-2
|View full text |Cite
|
Sign up to set email alerts
|

A Core-Partition Ranking Solution to Coalitional Ranking Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
5
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…As remarked in [16], the non-emptiness of the core-partition social ranking can be directly proved as a consequence of some results shown in [29]. A simple procedure has been proposed in [16] to compute an element of a core-partition social rankings. We introduce the procedure as the following pseudo-code (Algorithm 1).…”
Section: Example 15 Consider the Power Relation From Example 11mentioning
confidence: 92%
See 4 more Smart Citations
“…As remarked in [16], the non-emptiness of the core-partition social ranking can be directly proved as a consequence of some results shown in [29]. A simple procedure has been proposed in [16] to compute an element of a core-partition social rankings. We introduce the procedure as the following pseudo-code (Algorithm 1).…”
Section: Example 15 Consider the Power Relation From Example 11mentioning
confidence: 92%
“…A social ranking that is strongly based on models of coalition formation has been introduced in [16]. More precisely, in [16] the authors study a notion of set-valued social ranking that is defined as a set-valued function R : R(P (N)) ⇒ R(N) associating to each power relation a subset of rankings over the individuals R≿ ⊆ R(N).…”
Section: Example 15 Consider the Power Relation From Example 11mentioning
confidence: 99%
See 3 more Smart Citations