20 February 2020, Computational Social Choice Seminar, Aditya Aradhye

Abstract

We consider a social choice setting in which the alternatives are binary vectors and the preferences of the agents are determined by the Hamming distance from their most preferred alternative. We restrict the set of social choice functions to 'rules' which satisfy unanimity, anonymity and neutrality. As the preference domain is not the universal domain, the Gibbard–Satterthwaite Theorem does not hold. Hence, we study a stronger notion: group strategy-proof rules. We show an impossibility for strongly group strategy-proof rules.

For more information on the Computational Social Choice Seminar, please consult https://staff.science.uva.nl/u.endriss/seminar/.