Practical and efficient approximations of nash equilibria for win-lose games based on graph spectra

被引：0
|
作者：
Tsaknakis, Haralampos [1 ]
Spirakis, Paul G. [1 ,2 ]
机构：
[1] Research Academic Computer Technology Institute (RACTI), Greece
[2] Dept. of Computer Eng. and Informatics, Patras University, Patras, Greece
来源：
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2010年 / 6484 LNCS卷
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Directed graphs
引用
收藏
页码：378 / 390
相关论文
共 50 条
  • [1] Practical and Efficient Approximations of Nash Equilibria for Win-Lose Games Based on Graph Spectra
    Tsaknakis, Haralampos
    Spirakis, Paul G.
    [J]. INTERNET AND NETWORK ECONOMICS, 2010, 6484 : 378 - 390
  • [2] On the Approximation of Nash Equilibria in Sparse Win-Lose Games
    Liu, Zhengyang
    Sheng, Ying
    [J]. THIRTY-SECOND AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTIETH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / EIGHTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, : 1154 - 1160
  • [3] Efficient computation of Nash equilibria for very sparse win-lose bimatrix games
    Codenotti, Bruno
    Leoncini, Mauro
    Resta, Giovanni
    [J]. ALGORITHMS - ESA 2006, PROCEEDINGS, 2006, 4168 : 232 - 243
  • [4] The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games
    Vittorio Bilò
    Marios Mavronicolas
    [J]. Algorithmica, 2021, 83 : 447 - 530
  • [5] On the Approximation of Nash Equilibria in Sparse Win-Lose Multi-player Games
    Liu, Zhengyang
    Li, Jiawei
    Deng, Xiaotie
    [J]. THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 5557 - 5565
  • [6] The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games
    Bilo, Vittorio
    Mavronicolas, Marios
    [J]. ALGORITHMICA, 2021, 83 (02) : 447 - 530
  • [7] Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games
    Bilo, Vittorio
    Hansen, Kristoffer Arnsfelt
    Mavronicolas, Marios
    [J]. ALGORITHMIC GAME THEORY, SAGT 2023, 2023, 14238 : 40 - 57
  • [8] Some Tractable Win-Lose Games
    Datta, Samir
    Krishnamurthy, Nagarajan
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 365 - 376
  • [9] The Approximation Complexity of Win-Lose Games
    Chen, Xi
    Teng, Shang-Hua
    Valiant, Paul
    [J]. PROCEEDINGS OF THE EIGHTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2007, : 159 - +
  • [10] On the complexity of two-player win-lose games
    Abbott, T
    Kane, D
    Valiant, P
    [J]. 46th Annual IEEE Symposium on Foundations of Computer Science, Proceedings, 2005, : 113 - 122
12345