Scaling up collective decision making
- While the Internet has revolutionized many human endeavors, commerce, education, social networking, to name a few, it has had little impact on collective decision making. This thesis presents the author's work on understanding how to enable large scale collective decision making, from various angles such as: deploying novel mechanisms in practice, and studying them empirically; analyzing preference aggregation algorithms (social choice rules) with respect to provable optimization guarantees, e.g., of fairness; designing theoretical mechanisms of decision making with strategic interaction among agents. The three parts of this thesis are described below. Knapsack Voting for Participatory Budgeting: This part looks at the phenomenon of Participatory Budgeting, and discusses the author's work in overcoming the challenges faced in building a practical voting platform (https://pbstanford.org/) for the same - in particular, the novel Knapsack Voting method, and theoretical and empirical insights as to how it performs better than conventional methods. Metric Distortion and Fairness: Given the promise of algorithmic mechanisms in transforming societal decision making, a theoretical study of their efficiency and fairness becomes imperative. This section of the thesis discusses the usefulness of the metric distortion model in answering such questions. A novel method of quantifying fairness, using ideas from multi-objective optimization, is also presented. In addition to answering several open questions pertaining to metric distortion, it is shown how the simple Copeland rule achieves a constant-factor fairness ratio. Implementing the Lexicographic Maxmin Bargaining Solution: To broaden the scope of decision-making mechanisms to more complex settings, there is a need for protocols that incorporate the interaction of agents into their functioning. To this end, studying bargaining models is the natural first step. This section discusses the author's work on designing bargaining mechanisms which can guarantee (lexicographic) max-min fairness in equilibrium.
|Type of resource
|electronic resource; remote; computer; online resource
|1 online resource.
|Kollagunta Krishnaswamy, Anilesh
|Degree committee member
|Degree committee member
|Stanford University, Department of Electrical Engineering.
|Statement of responsibility
|Anilesh Kollagunta Krishnaswamy.
|Submitted to the Department of Electrical Engineering.
|Thesis Ph.D. Stanford University 2019.
- © 2019 by Anilesh Kollagunta Krishnaswamy
- This work is licensed under a Creative Commons Attribution Non Commercial 3.0 Unported license (CC BY-NC).
Also listed in
Loading usage metrics...