There are many reasons why societies run elections. For example, a given society may need
to select its leader (eg, a president), members of a team may need to find an appropriate …

We consider approval-based committee voting, ie the setting where each voter approves a
subset of candidates, and these votes are then used to select a fixed-size set of winners …

The area of computational social choice (COMSOC) analyzes collective decision problems
from an algorithmic perspective. So far, the main focus in this area lied on analyzing …

The goal of multi-winner elections is to choose a fixed-size committee based on voters'
preferences. An important concern in this setting is representation: large groups of voters …

We consider the following problem: There is a set of items (eg, movies) and a group of
agents (eg, passengers on a plane); each agent has some intrinsic utility for each of the …

Foundation models such as GPT-4 are fine-tuned to avoid unsafe or otherwise problematic
behavior, so that, for example, they refuse to comply with requests for help with committing …

Social choice becomes easier on restricted preference domains such as single-peaked,
single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the …

Decision-making systems increasingly orchestrate our world: how to intervene on the
algorithmic components to build fair and equitable systems is therefore a question of utmost …

We study computational aspects of three prominent voting rules that use approval ballots to
elect multiple winners. These rules are satisfaction approval voting, proportional approval …

Multiwinner voting rules are used to select a small representative subset of candidates or
items from a larger set given the preferences of voters. However, if candidates have …