A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
On the Indecisiveness of Kelly-Strategyproof Social Choice Functions
[article]
2022
arXiv
pre-print
Social choice functions (SCFs) map the preferences of a group of agents over some set of alternatives to a non-empty subset of alternatives. The Gibbard-Satterthwaite theorem has shown that only extremely restrictive SCFs are strategyproof when there are more than two alternatives. For set-valued SCFs, or so-called social choice correspondences, the situation is less clear. There are miscellaneous - mostly negative - results using a variety of strategyproofness notions and additional
arXiv:2102.00499v2
fatcat:ngkjegtms5ff3n5xcngdsu5wuq