We generalize the classic problem of fairly allocating indivisible goods to the problem of fair
public decision making, in which a decision must be made on several social issues …

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 …

We study the problem of fair sequential decision making given voter preferences. In each
round, a decision rule must choose a decision from a set of alternatives where each voter …

Perpetual voting is a framework for long-term collective decision making. In this framework,
we consider a sequence of subsequent approval-based elections and try to achieve a fair …

In this paper we introduce a new voting formalism to support long-term collective decision
making: perpetual voting rules. These are voting rules that take the history of previous …

We propose a multi-agent variant of the classical multi-armed bandit problem, in which there
are $ N $ agents and $ K $ arms, and pulling an arm generates a (possibly different) …

We study the following multiagent variant of the knapsack problem. We are given a set of
items, a set of voters, and a value of the budget; each item is endowed with a cost and each …

We present the first constant-factor approximation algorithm for maximizing the Nash social
welfare when allocating indivisible items to agents with budget-additive valuation functions …

Multiwinner voting captures a wide variety of settings, from parliamentary elections in
democratic systems to product placement in online shop** platforms. There is a large …

Participatory Budgeting processes are usually designed to span several years, with
referenda for new budget allocations taking place regularly. This paper presents the first …