Algorithms for gerrymandering over graphs

Takehiro Ito, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamot

研究成果: Conference contribution

2 被引用数 (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.

本文言語English
ホスト出版物のタイトル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
出版ステータスPublished - 2019 1 1
イベント18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019 - Montreal, Canada
継続期間: 2019 5 132019 5 17

出版物シリーズ

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

Conference

Conference18th International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2019
CountryCanada
CityMontreal
Period19/5/1319/5/17

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering

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

引用スタイル