Algorithms for gerrymandering over graphs

Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamot

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

4 被引用数 (Scopus)

抄録

We initiate the systematic algorithmic study for gerrymandering over graphs that was recently introduced by Cohen-Zemach, Lewen-berg and Rosenschein. Namely, we study a strategic procedure for a political districting designer to draw electoral district boundaries so that a particular target candidate can win in an election. We focus on the existence of such a strategy under the plurality voting rule, and give interesting contrasts which classify easy and hard instances with respect to polynomial-time solvability. For example, we prove that the problem for trees is strongly NP-complete (thus unlikely to have a pseudo-polynomial-time algorithm), but has a pseudo-polynomial-time algorithm when the number of candidates is constant. Another example is to prove that the problem for complete graphs is NP-complete when the number of electoral districts is two, while is solvable in polynomial time when it is more than two.

本文言語英語
ホスト出版物のタイトル18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019
出版社International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
ページ1413-1421
ページ数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

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

フィンガープリント

「Algorithms for gerrymandering over graphs」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル