טכניון מכון טכנולוגי לישראל
הטכניון מכון טכנולוגי לישראל - בית הספר ללימודי מוסמכים  
Ph.D Thesis
Ph.D StudentElad Dokow
SubjectAggregation of Opinions on Interrelated Issues
DepartmentDepartment of Mathematics
Supervisor Full Professor Holzman Ron
Full Thesis textFull thesis text - English Version


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. Relevant concepts and results for the binary case are recalled in the introduction. In the research we study two different aggregation models: the binary model with abstentions and the non-binary model.

In the second chapter the binary model is extended to allow for abstentions on some of the issues. It is shown that the same structural conditions on the set of feasible evaluations that lead to dictatorship in the model without abstentions, lead to oligarchy in the presence of abstentions. Arrow's impossibility theorem for social welfare functions, Gibbard's oligarchy theorem for quasi-transitive social decision functions, as well as some apparently new theorems on preference aggregation, are obtained as corollaries.

In the third chapter we study the general model in which each issue can have more than two positions.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.