A note on the complexity of determining optimal strategies in games with common payoffs

被引：0
|
作者：
Woeginger, GJ
机构：
[1] Univ Twente, Dept Math, NL-7500 AE Enschede, Netherlands
[2] Eindhoven Univ Technol, Dept Math & Comp Sci, NL-5600 MB Eindhoven, Netherlands
来源：
MATHEMATICAL METHODS OF OPERATIONS RESEARCH | 2003年 / 58卷 / 02期
关键词：
games; computational complexity; common payoffs;
D O I：
10.1007/s001860300300
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
In a recent paper [Int J Game Theory (2001) 30:99-106], Chu and Halpern investigated the problem of finding optimal strategies in certain games with common payoffs. This short technical note answers a computational complexity question that was left open in their paper.
引用
收藏
页码：183 / 189
页数：7
相关论文
共 50 条
  • [1] A note on the complexity of determining optimal strategies in games with common payoffs
    Gerhard J. Woeginger
    [J]. Mathematical Methods of Operations Research, 2003, 58 : 183 - 189
  • [2] Determining the Optimal Strategies for Stochastic Positional Games with Discounted Payoffs
    Lozovanu, Dmitrii
    [J]. 2015 20TH INTERNATIONAL CONFERENCE ON CONTROL SYSTEMS AND COMPUTER SCIENCE, 2015, : 393 - 396
  • [3] Optimal data-hiding strategies for games with BER payoffs
    Comesaña, P
    Pérez-González, F
    Balado, F
    [J]. DIGITAL WATERMARKING, 2004, 2939 : 101 - 116
  • [4] Computing Optimal Mixed Strategies for Security Games with Dynamic Payoffs
    Yin, Yue
    Xu, Haifeng
    Gan, Jiarui
    An, Bo
    Jiang, Albert Xin
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 681 - 687
  • [5] On the NP-completeness of finding an optimal strategy in games with common payoffs
    Chu, F
    Halpern, J
    [J]. INTERNATIONAL JOURNAL OF GAME THEORY, 2001, 30 (01) : 99 - 106
  • [6] On the NP-completeness of finding an optimal strategy in games with common payoffs
    Francis Chu
    Joseph Halpern
    [J]. International Journal of Game Theory, 2001, 30 : 99 - 106
  • [7] Pareto Optimal Strategies for Matrix Games with Payoffs of Intuitionistic Fuzzy Sets
    Nan, Jiang-Xia
    Wei, Cheng-Lin
    Li, Deng-Feng
    [J]. GAME THEORY AND APPLICATIONS, 2017, 758 : 148 - 161
  • [8] Pareto-optimal security strategies in matrix games with fuzzy payoffs
    Clemente, M.
    Fernandez, F. R.
    Puerto, J.
    [J]. FUZZY SETS AND SYSTEMS, 2011, 176 (01) : 36 - 45
  • [9] On determining optimal strategies in pursuit games in the plane
    Le, NM
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, 1995, 944 : 499 - 510
  • [10] On determining optimal strategies in pursuit games in the plane
    Le, NM
    [J]. THEORETICAL COMPUTER SCIENCE, 1998, 197 (1-2) : 203 - 234
12345