Analysis of inefficiencies in systems with many independent agents

Authors
Postl, John
ORCID
Loading...
Thumbnail Image
Other Contributors
Anshelevich, Elliot
Kar, Koushik
Magdon-Ismail, Malik
Xia, Lirong
Issue Date
2016-05
Keywords
Computer science
Degree
PhD
Terms of Use
This electronic version is a licensed copy owned by Rensselaer Polytechnic Institute, Troy, NY. Copyright of original work retained by author.
Full Citation
Abstract
Finally, we examine the quality of social choice functions, which map agents' orderings over a set of alternatives to a single winning alternative. We assume that every agent has costs over all of the alternatives and that these costs form a metric space. However, the social choice mechanisms may not have access to these costs, especially since they may be unknown to the agents themselves. As a result, we cannot simply select the alternative that minimizes the total agent cost. Instead, we assume that the social choice functions only have access to the agents' ordinal preferences that are induced by the metric space. We examine the distortion, which is the worst-case ratio of the quality of the alternative selected by the social choice mechanism and the quality of the optimal alternative. Bounding the distortion acts as a method for determining the quality of the social choice function itself. We provide distortion bounds for a variety of deterministic and randomized mechanisms, such as plurality, Copeland, and randomized dictatorship.
Description
May 2016
School of Science
Department
Dept. of Computer Science
Publisher
Rensselaer Polytechnic Institute, Troy, NY
Relationships
Rensselaer Theses and Dissertations Online Collection
Access
Restricted to current Rensselaer faculty, staff and students. Access inquiries may be directed to the Rensselaer Libraries.