We introduce a novel principle that we call weak pairwise justifiability, which applies to a large class of collective choice rules, including the social choice functions and the social welfare functions about which the Gibbard–Satterthwaite theorem and Arrow’s impossibility theorem are predicated, respectively. We prove that, under appropriate qualifications, our principle is a common root for these two classical results, when applied to rules defined over the full domain of weak preference orders (also for strict
Weak pairwise justifiability as a common root of Arrow’s and the Gibbard–Satterthwaite theorems
Antonio NicoloMembro del Collaboration Group
;
2025
Abstract
We introduce a novel principle that we call weak pairwise justifiability, which applies to a large class of collective choice rules, including the social choice functions and the social welfare functions about which the Gibbard–Satterthwaite theorem and Arrow’s impossibility theorem are predicated, respectively. We prove that, under appropriate qualifications, our principle is a common root for these two classical results, when applied to rules defined over the full domain of weak preference orders (also for strictFile in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
s00355-024-01575-6 (1).pdf
accesso aperto
Tipologia:
Published (publisher's version)
Licenza:
Creative commons
Dimensione
419.23 kB
Formato
Adobe PDF
|
419.23 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.