4 research outputs found
Models of Manipulation on Aggregation of Binary Evaluations
We study a general aggregation problem in which a society has to determine
its position on each of several issues, based on the positions of the members
of the society on those issues. There is a prescribed set of feasible
evaluations, i.e., permissible combinations of positions on the issues. Among
other things, this framework admits the modeling of preference aggregation,
judgment aggregation, classification, clustering and facility location. An
important notion in aggregation of evaluations is strategy-proofness. In the
general framework we discuss here, several definitions of strategy-proofness
may be considered. We present here 3 natural \textit{general} definitions of
strategy-proofness and analyze the possibility of designing an annonymous,
strategy-proof aggregation rule under these definitions