Models of Manipulation on Aggregation of Binary Evaluations

Details Models of Manipulation on Aggregation of Binary Evaluations Models of Manipulation on Aggregation of Binary Evaluations

2012-01-30

arxiv.org/abs/1201.6388v1

Computer Science

Computer Science and Game Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Models of Manipulation on Aggregation of Binary Evaluations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Models of Manipulation on Aggregation of Binary Evaluations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Models of Manipulation on Aggregation of Binary Evaluations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-56251