Manipulation-resistant facility location mechanisms for ZV-line graphs

Ilan Nehama, Taiki Todo, Makoto Yokoo

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

4 被引用数 (Scopus)

抄録

In many real-life scenarios, a group of agents needs to agree on a common action, e.g., on a location for a public facility, while there is some consistency between their preferences, e.g., all preferences are derived from a common metric space. The facility location problem models such scenarios and it is a well-studied problem in social choice. We study mechanisms for facility location on unweighted undirected graphs, which are resistant to manipulations (strategy-proof, abstention-proof, and false-name-proof) by both individuals and coalitions and are efficient (Pareto optimal). We define a family of graphs, ZV-line graphs, and show a general facility location mechanism for these graphs which satisfies all these desired properties. Our result unifies the few works in the literature of false-name-proof facility location on discrete graphs including the preliminary (unpublished) works we are aware of.

本文言語英語
ホスト出版物のタイトル18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019
出版社International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
ページ1452-1460
ページ数9
ISBN(電子版)9781510892002
出版ステータス出版済み - 1 1 2019
イベント18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019 - Montreal, カナダ
継続期間: 5 13 20195 17 2019

出版物シリーズ

名前Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
3
ISSN(印刷版)1548-8403
ISSN(電子版)1558-2914

会議

会議18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019
国/地域カナダ
CityMontreal
Period5/13/195/17/19

All Science Journal Classification (ASJC) codes

  • 人工知能
  • ソフトウェア
  • 制御およびシステム工学

引用スタイル