Preference Aggregation over Restricted Ballot Languages: Sincerity and Strategy-Proofness
نویسندگان
چکیده
Voting theory provides useful insights for multiagent preference aggregation. However, the standard setting assumes totally ordered preferences, as well as a ballot language that coincides with the preference language. In typical AI scenarios, these assumptions do not hold: certain alternatives may be incomparable for some agents, and others may have their preferences encoded in a format that is different from how preference aggregation mechanism wants them. We study the consequences of dropping these assumptions. In particular, we investigate the consequences for the important notion of strategy-proofness. While strategy-proofness cannot be guaranteed in the classical setting, we are able to show that there are situations in our more general framework where this is possible. We also consider computational aspects of the problem.
منابع مشابه
Some Results for Impossibility Theorems of Social Welfare Function and Social Choice Function
We present some results on social welfare function and social choice function. First, we replace weak Pareto principle of Arrow’s axioms with strong Pareto principle, and then show that assuming unrestricted domain property, independence of irrelevant alternatives and strong Pareto principle on a social welfare function in Arrow’s sense leads to the existence of first to nth commanders whose st...
متن کامل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...
متن کاملThe Equivalence of Strong Positive Association and Strategy-proofness EITAN MULLER AND MARK
Consider a group that must select one alternative from a set of three or more alternatives. Each member casts a ballot that the voting procedure counts. For a given alternative X, let two ballot profiles C and D have the property that if a member ranks alternative x above alternative y within C, then he also ranks x above that y within D. Strong positive association requires that if the voting ...
متن کاملStrategy-proof Judgment Aggregation
Which rules for aggregating judgments on logically connected propositions are manipulable and which not? In this paper, we introduce a preference-free concept of non-manipulability and contrast it with a preference-theoretic concept of strategy-proofness. We characterize all non-manipulable and all strategy-proof judgment aggregation rules and prove an impossibility theorem similar to the Gibba...
متن کاملFuzzy voters, Crisp Votes
In a binary choice voting scenario, voters may have fuzzy preferences but are required to make crisp choices. In order to compare a crisp voting procedure with more general mechanisms of fuzzy preference aggregation, we first focus on the latter. We present a formulation of strategy-proofness in this setting and study its consequences. On one hand, we achieve an axiomatic recommendation of the ...
متن کامل