Dear all,
I'm delighted to announce the next COMSOC Seminar. This Thursday at 15:00 we'll have Aditya Aradhye from Maastricht University talk about his work on group-strategyproof aggregation rules in multidimensional domains. I'm including the abstract below and am looking forward to seeing you here on Thursday.
As always, for more information on the COMSOC Seminar please consult http://www.illc.uva.nl/~ulle/seminar/.
All the best, Ulle
-------------------------------------------------------------------------
Speaker: Aditya Aradhye (Maastricht) Title: Group Strategy-Proof Rules in Multidimensional Domains Date: Thursday 20 February 2020 Time: 15:00 Location: ILLC Seminar Room F1.15, Science Park 107, Amsterdam
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.