False-name manipulation in weighted voting games is hard for probabilistic polynomial time

被引：0
|
作者：
机构：
[1] Rey, Anja
[2] Rothe, Jörg
来源：
| 1600年 / AI Access Foundation卷 / 50期
关键词：
Polynomial approximation - Hardness;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 16 条
  • [1] False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time
    Rey, Anja
    Rothe, Joerg
    [J]. LATIN 2014: THEORETICAL INFORMATICS, 2014, 8392 : 60 - 71
  • [2] False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time
    Rey, Anja
    Rothe, Joerg
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2014, 50 : 573 - 601
  • [3] False-Name Manipulation in Weighted Voting Games: Empirical and Theoretical Analysis
    Lasisi, Ramoni O.
    Allan, Vicki H.
    [J]. COMPUTATIONAL INTELLIGENCE, 2017, 33 (03) : 478 - 506
  • [4] False-Name Manipulations in Weighted Voting Games
    Aziz, Haris
    Bachrach, Yoram
    Elkind, Edith
    Paterson, Mike
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2011, 40 : 57 - 93
  • [5] Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with Application to False-Name Manipulation
    Gafni, Yotam
    Lavi, Ron
    Tennenholtz, Moshe
    [J]. Journal of Artificial Intelligence Research, 2021, 72 : 99 - 135
  • [6] Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with an Application to False-name Manipulation
    Gafni, Yotam
    Lavi, Ron
    Tennenholtz, Moshe
    [J]. PROCEEDINGS OF THE THIRTIETH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2021, 2021, : 210 - 216
  • [7] Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with Application to False-Name Manipulation
    Gafni, Yotam
    Lavi, Ron
    Tennenholtz, Moshe
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2021, 72 : 99 - 135
  • [8] Computing the nucleolus of weighted voting games in pseudo-polynomial time
    Kanstantsin Pashkovich
    [J]. Mathematical Programming, 2022, 195 : 1123 - 1133
  • [9] Computing the nucleolus of weighted voting games in pseudo-polynomial time
    Pashkovich, Kanstantsin
    [J]. MATHEMATICAL PROGRAMMING, 2022, 195 (1-2) : 1123 - 1133
  • [10] Manipulation in Communication Structures of Graph-Restricted Weighted Voting Games
    Kaczmarek, Joanna
    Rothe, Joerg
    [J]. ALGORITHMIC DECISION THEORY, ADT 2021, 2021, 13023 : 194 - 208
12