Journal article icon

Journal article

Group activity selection on social networks

Abstract:

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 long as the network is acyclic. In contrast, if each activity can be assigned to a single group only, finding stable outcomes becomes intractable, even if the underlying network is very simple: the pr...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:

Authors


More by this author
Institution:
University of Oxford
Oxford college:
St Catherine's College
Role:
Author
More by this author
Institution:
University of Oxford
Oxford college:
Balliol College
Role:
Author
More by this author
Institution:
University of Oxford
Oxford college:
Balliol College
Role:
Author
Keywords:
Pubs id:
pubs:660304
UUID:
uuid:cae86e26-ef8e-4331-9faa-5984d26f6a8d
Local pid:
pubs:660304
Source identifiers:
660304
Deposit date:
2017-01-26

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP