Parity games on undirected graphs

被引：0
|
作者：
Berwanger, Dietmar [2 ]
Serre, Olivier [1 ,2 ]
机构：
[1] Univ Paris 07, LIAFA, F-75221 Paris 05, France
[2] CNRS, F-75700 Paris, France
来源：
INFORMATION PROCESSING LETTERS | 2012年 / 112卷 / 23期
关键词：
Algorithms; Parity games; Graph structure complexity; WIDTH;
D O I：
10.1016/j.ipl.2012.08.021
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We examine the complexity of solving parity games in the special case when the underlying game graph is undirected. For strictly alternating games, that is, when the game graph is bipartite between the players, we observe that the solution can be computed in linear time. In contrast, when the assumption of strict alternation is dropped, we show that the problem is as hard in the undirected case as it is in the general, directed, case. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：928 / 932
页数：5
相关论文
共 50 条
  • [1] Reputation games for undirected graphs
    Avis, David
    Iwama, Kazuo
    Paku, Daichi
    DISCRETE APPLIED MATHEMATICS, 2014, 166 : 1 - 13
  • [2] Parity Games on Temporal Graphs
    Austin, Pete
    Bose, Sougata
    Totzke, Patrick
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, PT I, FOSSACS 2024, 2024, 14574 : 79 - 98
  • [3] Parity and exploration games on infinite graphs
    Gimbert, H
    COMPUTER SCIENCE LOGIC, PROCEEDINGS, 2004, 3210 : 56 - 70
  • [4] Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs
    Avis, David
    Iwama, Kazuo
    Paku, Daichi
    ALGORITHMS AND COMPUTATION, 2011, 7074 : 415 - 424
  • [5] Complexity of equilibria in binary public goods games on undirected graphs
    Klimm, Max
    Stahlberg, Maximilian J.
    arXiv, 2023,
  • [6] Complexity of equilibria in binary public goods games on undirected graphs
    Klimm, Max
    Stahlberg, Maximilian J.
    EC 2023 - Proceedings of the 24th ACM Conference on Economics and Computation, 2023, : 938 - 955
  • [7] Parity Games on Graphs with Medium Tree-Width
    Fearnley, John
    Lachish, Oded
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 303 - 314
  • [8] Parity Games with Partial Information Played on Graphs of Bounded Complexity
    Puchala, Bernd
    Rabinovich, Roman
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2010, 2010, 6281 : 604 - 615
  • [9] ON RIGID UNDIRECTED GRAPHS
    HEDRLIN, Z
    PULTR, A
    CANADIAN JOURNAL OF MATHEMATICS, 1966, 18 (06): : 1237 - &
  • [10] Controllability of undirected graphs
    Farrugia, Alexander
    Sciriha, Irene
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 454 : 138 - 157
12345