Partial Preference Order is a binary relation in decision theory that ranks alternatives based on pairwise comparisons while allowing for incomparabilities, thereby forming a reflexive and transitive preorder that does not require all elements to be comparable.
174
Publications
9.5K
Citations
341
Authors
205
Institutions
Publications per year
2017–2026
23
Variants
Partial Preference Ordering
Parents
Publications
174
1–5 of 174
Authors
341
- PC
8
h-index
- PF
4
h-index
- KB
3
h-index
- PP
3
h-index
- FR
3
h-index
1–5 of 341
Institutions
205
Sichuan University
Chengdu, China
5 h-index
8 publications
552 citations
Centre National de la Recherche Scientifique
Paris, France
5 h-index
9 publications
544 citations
AGH University of Krakow
Krakow, Poland
4 h-index
4 publications
132 citations
New York University
New York, United States
4 h-index
4 publications
475 citations
University of Padua
Padua, Italy
4 h-index
9 publications
303 citations
Tel Aviv University
Tel Aviv, Israel
3 h-index
3 publications
310 citations
Lund University
Lund, Sweden
3 h-index
3 publications
342 citations
Hohai University
Nanjing, China
3 h-index
7 publications
361 citations
1–8 of 205
Venues
- European Journal of Operational Research
13 publications · 2K citations
13
h-index
- Econometrica
9 publications · 427 citations
9
h-index
- Journal of Mathematical Psychology
9 publications · 515 citations
9
h-index
- Fuzzy Sets and Systems
6 publications · 300 citations
6
h-index
- Journal of Economic Theory
JET · 5 publications · 372 citations
5
h-index
1–5