On the Complexity of n-player Toppling Dominoes

被引：0
|
作者：
Cincotti, Alessandro [1 ]
机构：
[1] Japan Adv Inst Sci & Technol, Sch Informat Sci, Nomi, Ishikawa 9231292, Japan
来源：
INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III | 2010年
关键词：
Combinatorial games; Toppling Dominoes; n-player games; PSPAC epsilon-complete;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Why are n-player games much more complex than two-player games? Is it much more difficult to cooperate or to compete? n-player Toppling Dominoes is an n-player version of Toppling Dominoes, a two-player combinatorial game. Because of queer games, i.e., games where no player has a winning strategy, cooperation is a key-factor in n-player games and, as a consequence, n-player Toppling Dominoes played on a set of rows of dominoes is PSPAC epsilon-complete.
引用
收藏
页码：461 / 464
页数：4
相关论文
共 50 条
  • [1] RETRACTED: On the Complexity of n-player Cherries (Retracted Article)
    Cincotti, Alessandro
    [J]. PROCEEDINGS 2010 3RD IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, (ICCSIT 2010), VOL 1, 2010, : 481 - 483
  • [2] The n-player Hirshleifer contest
    Ewerhart, Christian
    Sun, Guang-Zhen
    [J]. GAMES AND ECONOMIC BEHAVIOR, 2024, 143 : 300 - 320
  • [3] Symmetry in n-player games
    Plan, Asaf
    [J]. JOURNAL OF ECONOMIC THEORY, 2023, 207
  • [4] The game of n-player Cutcake
    Cincotti, Alessandro
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (41) : 5678 - 5683
  • [5] N-player partizan games
    Cincotti, Alessandro
    [J]. THEORETICAL COMPUTER SCIENCE, 2010, 411 (34-36) : 3224 - 3234
  • [6] Strategies in N-player Iterated Game
    Ge Zhiyuan
    Liu Jiamei
    Mu Miaomiao
    [J]. SYSTEMS, ORGANIZATIONS AND MANAGEMENT: PROCEEDINGS OF THE 3RD WORKSHOP OF INTERNATIONAL SOCIETY IN SCIENTIFIC INVENTIONS, 2009, : 235 - 239
  • [7] Analyzing n-player impartial games
    Walter O. Krawec
    [J]. International Journal of Game Theory, 2012, 41 : 345 - 367
  • [8] Cooperation and computability in n-player games
    Anderlini, L
    Sabourian, H
    [J]. MATHEMATICAL SOCIAL SCIENCES, 2001, 42 (02) : 99 - 137
  • [9] n-PLAYER PRISONERS' DILEMMA GAME
    Kecek, Damira
    [J]. TEHNICKI GLASNIK-TECHNICAL JOURNAL, 2013, 7 (01): : 80 - 83
  • [10] N-player quantum minority game
    Chen, Q
    Yi, W
    Liu, JT
    Wang, KL
    [J]. PHYSICS LETTERS A, 2004, 327 (2-3) : 98 - 102
12345