50 citations · 244 across the 32 of their papers we have counts for
4 papers · 1 filter
Group Activity Selection on Social Networks
Ayumi Igarashi, Robert Bredereck, Dominik Peters +1
We propose a new variant of the group activity selection problem (GASP), where the agents are placed on a social network and activities can only be assigned to connected subgroups…
Condorcet's Principle and the Preference Reversal Paradox
Dominik Peters
We prove that every Condorcet-consistent voting rule can be manipulated by a voter who completely reverses their preference ranking, assuming that there are at least 4 alternatives…
Fair Division of a Graph
Sylvain Bouveret, Katarína Cechlárová, Edith Elkind +2
We consider fair allocation of indivisible items under an additional constraint: there is an undirected graph describing the relationship between the items, and each agent's share…
k-Majority Digraphs and the Hardness of Voting with a Constant Number of Voters
Georg Bachmeier, Felix Brandt, Christian Geist +4
Many hardness results in computational social choice make use of the fact that every directed graph may be induced as the pairwise majority relation of some preference profile. How…