On the tradeoff between efficiency and strategyproofness
On the tradeoff between efficiency and strategyproofness
H. Aziz,F. Brandl,F. Brandt,Markus Brill
2018 · DOI: 10.1016/J.GEB.2018.03.005
33 Citations
TLDR
It is shown that strict maximal lotteries are PC-efficient and ST-strategyproof, and it is proved the incompatibility of PC-efficiency and PC-str strategyproofness for anonymous and neutral SDSs.