Name
Abstract | ||
|---|---|---|
We study an 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. The binary case of this problem, where only two positions are allowed on each issue, is by now quite well understood. We consider arbitrary sets of conceivable positions on each issue. This general framework admits the modeling of aggregation of various types of evaluations, including: assignments of candidates to jobs, choice functions from sets of alternatives, judgments in many-valued logic, probability estimates for events, etc. We require that the aggregation be performed issue-by-issue, and that the social position on each issue be supported by at least one member of the society. The set of feasible evaluations is called an impossibility domain if these requirements are satisfied for it only by dictatorial aggregation; that is to say, if it gives rise to an analogue of Arrow's impossibility theorem for preference aggregation. We obtain a two-part sufficient condition for an impossibility domain, and show that the major part is a necessary condition. For the ternary case, where three positions are allowed on each issue, we get a full characterization of impossibility domains. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.aam.2010.02.005 | Advances in Applied Mathematics |
Keywords | Field | DocType |
dictatorial aggregation,non-binary evaluation,impossibility domain,feasible evaluation,social choice,assignment problem.,conceivable position,binary case,arbitrary set,arrow's theorem,aggregation problem,impossibility theorem,judgment aggregation,necessary condition,impossibil- ity domains,preference aggregation,many valued logic,assignment problem,satisfiability,choice function | Social choice theory,Aggregation problem,Arrow's impossibility theorem,Combinatorics,Mathematical economics,Arrow,Mathematical analysis,Impossibility,Probability distribution,Assignment problem,Mathematics,Binary number | Journal |
Volume | Issue | ISSN |
45 | 4 | 0196-8858 |
Citations | PageRank | References |
22 | 4.24 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elad Dokow | 1 | 84 | 9.39 |
| Ron Holzman | 2 | 287 | 43.78 |