activity
20162026
most citedWeighted Envy-Freeness in Indivisible Item Allocation

58 citations · 268 across the 37 of their papers we have counts for

collaborators
Showing 2017Show all

5 papers · 1 filter

cs.GT2017

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…

cs.GT2017★ 1 cited

Cooperative Games with Bounded Dependency Degree

Ayumi Igarashi, Rani Izsak, Edith Elkind

Cooperative games provide a framework to study cooperation among self-interested agents. They offer a number of solution concepts describing how the outcome of the cooperation shou…

cs.GT2017★ 13 cited

Multiwinner Elections with Diversity Constraints

Robert Bredereck, Piotr Faliszewski, Ayumi Igarashi +2

We develop a model of multiwinner elections that combines performance-based measures of the quality of the committee (such as, e.g., Borda scores of the committee members) with div…

cs.GT2017★ 10 cited

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…

cs.GT2017★ 5 cited

On Parameterized Complexity of Group Activity Selection Problems on Social Networks

Ayumi Igarashi, Robert Bredereck, Edith Elkind

In Group Activity Selection Problem (GASP), players form coalitions to participate in activities and have preferences over pairs of the form (activity, group size). Recently, Igara…