EUVIMEDEUVIMED entdecken
Crossref

Lexicographic social ranking

Roberto Lucchetti, Monica Milasi, Stefano Moretti

Social Choice and Welfare · 2026-11 · 67 (3) · 741-756

DOI: 10.1007/s00355-026-01660-y ↗

Kurz gefasst

Fachartikel in der Zeitschrift Social Choice and Welfare, online erschienen am 15.04.2026. Verfasst von Roberto Lucchetti und 2 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 15 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this paper we focus on the analysis of ranking methods based on a lexicographic comparison of individual evaluations. Notable examples of ranking methods in this family are the majority judgement, the lexicographic excellence and its dual version. Making a bridge with the theory of lexicographic preferences on elements with multiple factors, we provide an axiomatic characterization of the family of lexicographic methods using three well-studied properties in social choice: Anonymity, Neutrality and Independence of Irrelevant Alternatives. These assumptions allow restricting the study to the set of individual evaluations rearranged in a non increasing way. Two further assumptions of Ordinal Invariance and Dominance (restricted to this domain) allow for the requested characterization. Some operational indications on how to establish the order used by the lexicographic procedure is also discussed.

Zitieren

APA

Lucchetti, R., Milasi, M., & Moretti, S. (2026). Lexicographic social ranking. Social Choice and Welfare, 67(3), 741-756. https://doi.org/10.1007/s00355-026-01660-y

Vancouver

Lucchetti R, Milasi M, Moretti S. Lexicographic social ranking. Social Choice and Welfare. 2026;67(3):741-756. doi:10.1007/s00355-026-01660-y

BibTeX
@article{Lucchetti2026,
  author = {Lucchetti, Roberto and Milasi, Monica and Moretti, Stefano},
  title = {Lexicographic social ranking},
  journal = {Social Choice and Welfare},
  year = {2026},
  volume = {67},
  number = {3},
  pages = {741--756},
  doi = {10.1007/s00355-026-01660-y}
}
Kostenlos starten →