Conference item icon

Conference item

Schelling games on graphs

Abstract:

We consider strategic games that are inspired by Schelling's model of residential segregation. In our model, the agents are partitioned into k types and need to select locations on an undirected graph. Agents can be either stubborn, in which case they will always choose their preferred location, or strategic, in which case they aim to maximize the fraction of agents of their own type in their neighborhood. We investigate the existence of equilibria in these games, study the complexity of find...

Expand abstract
Publication status:
Published
Peer review status:
Reviewed (other)

Actions


Access Document


Files:
  • (Version of record, pdf, 172.9KB)
Publisher copy:
10.24963/ijcai.2019/38

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS Division
Department:
Computer Science
Department:
Unknown
Role:
Author
Publisher:
International Joint Conferences on Artificial Intelligence Organization Publisher's website
Journal:
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence 2019 Journal website
Host title:
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence 2019
Publication date:
2019-08-01
Acceptance date:
2019-05-09
DOI:
ISSN:
1045-0823
Source identifiers:
1046093
ISBN:
9780999241141
Keywords:
Pubs id:
pubs:1046093
UUID:
uuid:3d17a901-3304-40f2-b4fc-cee46adbf11c
Local pid:
pubs:1046093
Deposit date:
2019-08-19

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