43 citations · 53 across the 6 of their papers we have counts for
5 papers · 1 filter
On the Convergence of Iterated Round Robin
Maxime Lucet, Henri Surugue, Nawal Benabbou +3
Round Robin (RR) is a simple and widely used picking sequence mechanism for allocating indivisible goods, known to guarantee envy-freeness up to one item (EF1) when preferences are…
Computational Social Choice: Research & Development
Dorothea Baumeister, Ratip Emin Berker, Niclas Boehmer +7
Computational social choice (COMSOC) studies principled ways to aggregate conflicting individual preferences into collective decisions. In this paper, we call for an increased effo…
Proportionality for Constrained Public Decisions
Julian Chingoma, Umberto Grandi, Arianna Novaro
We study situations where a group of voters need to take a collective decision over a number of public issues, with the goal of getting a result that reflects the voters' opinions…
Repeated Fair Allocation of Indivisible Items
Ayumi Igarashi, Martin Lackner, Oliviero Nardi +1
The problem of fairly allocating a set of indivisible items is a well-known challenge in the field of (computational) social choice. In this scenario, there is a fundamental incomp…
Strategic disclosure of opinions on a social network
Umberto Grandi, Emiliano Lorini, Laurent Perrussel
We study the strategic aspects of social influence in a society of agents linked by a trust network, introducing a new class of games called games of influence. A game of influence…