Computer Science Thesis Oral
— 12:00pm
Location:
In Person and Virtual - ET
-
Traffic21 Classroom, Gates Hillman 6501 and Zoom
Speaker:
PAUL GÖLZ
,
Ph.D. Candidate, Computer Science Department, Carnegie Mellon University
https://paulgoelz.de/
Social Choice for Social Good: Proposals for Democratic Innovation from Computer Science
Driven by shortcomings of current democratic systems, practitioners and political scientists are exploring democratic innovations, i.e., institutions for decision-making that more directly involve constituents. In this thesis, we support this exploration using tools from computer science, via three approaches: we design practical algorithms for use in democratic innovations, we mathematically analyze the fairness properties of proposed decision-making processes, and we identify extensions of such processes that satisfy desirable properties. Our work mixes techniques from computational social choice, algorithms, optimization, probabilistic modeling, and empirical analysis.
In Part I, we apply the first two approaches to citizens' assemblies, which are randomly selected panels of constituents who deliberate on a policy issue. We analyze existing algorithms for the random selection of these assemblies, and we design new algorithms for this task that are provably fair and now widely used in practice. In addition, we design algorithms for partitioning assembly members into deliberation groups, which allow more members to interact than before.
Part II identifies extensions to liquid democracy and legislative apportionment. First, we demonstrate that a variant of liquid democracy, in which agents are asked for two potential delegates rather than a single delegate, reduces the concentration of power observed in classic liquid democracy. Second, we extend legislative elections over parties to approval ballots, and give apportionment methods for this setting that satisfy strong proportionality axioms. Finally, we extend a proposal for the randomized apportionment of legislative seats over states to satisfy additional monotonicity axioms. In Part III of this thesis, we engage with a specific policy topic, refugee resettlement. We design algorithms for allocating resettled refugees to localities in a country, which improves these refugees' chances of finding employment over the status quo and is now being used by a major US resettlement agency.
Thesis Committee:
Ariel Procaccia (Chair)
Anupam Gupta
Tuomas Sandholm
Avrim Blum (Toyota Technological Institute at Chicago)
David Parkes (Harvard University)
In Person & Zoom Participation. See announcement.
For More Information:
deb@cs.cmu.edu