Group activity selection on social networks
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. We show that if multiple groups can simultaneously engage in the same activity, finding a stable outcome is easy as lon...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Association for the Advancement of Artificial Intelligence
2017
|