Traditionally, social choice theory has only been applicable to choices ...
In computational social choice, the distortion of a voting rule quantifi...
The design of algorithms for political redistricting generally takes one...
A key promise of democratic voting is that, by accounting for all
consti...
Social media platforms are known to optimize user engagement with the he...
Platforms for online civic participation rely heavily on methods for
con...
In an epidemic, how should an organization with limited testing resource...
Apportionment is the problem of distributing h indivisible seats across
...
In the design and analysis of political redistricting maps, it is often
...
Fluid democracy is a voting paradigm that allows voters to choose betwee...
Employment outcomes of resettled refugees depend strongly on where they ...
Participatory budgeting is a method used by city governments to select p...
We study fair allocation of indivisible goods among agents. Prior resear...
According to the goal-gradient hypothesis, people increase their efforts...
Today's high-stakes adversarial interactions feature attackers who const...
In classic fair division problems such as cake cutting and rent division...
Migration presents sweeping societal challenges that have recently attra...
It is common to see a handful of reviewers reject a highly novel paper,
...
Liquid democracy is the principle of making collective decisions by lett...
We investigate the query complexity of the fair allocation of indivisibl...
An organizational structure defines how an organization arranges and man...
This paper is part of an emerging line of work at the intersection of ma...
We design and analyze a protocol for dividing a state into districts, wh...
The Lazy Shortest Path (LazySP) class consists of motion-planning algori...
We present a general approach to automating ethical decisions, drawing o...
We consider goods that can be shared with k-hop neighbors (i.e., the set...
Voting systems typically treat all voters equally. We argue that perhaps...
We consider the problem of selecting a subset of alternatives given nois...
We consider directed graphs over a set of n agents, where an edge (i,j) ...