Lower bounds for multiplayer noncooperative games of incomplete information-Reference-Cited by-同舟云学术

Lower bounds for multiplayer noncooperative games of incomplete information

Published:2001-04 Issue:7-8 Volume:41 Page:957-992
ISSN:0898-1221
Container-title:Computers & Mathematics with Applications
language:en
Short-container-title:Computers & Mathematics with Applications

Author:

Peterson G.,Reif J.,Azhar S.

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Modelling and Simulation

Reference27 articles.

1. Multiple-person alternation;Peterson;Proceedings of the 20th IEEE Symposium on Foundations of Computer Science,1979

2. Alternation;Chandra;J. of ACM,1981

3. Universal games of incomplete information;Reif;Proceedings of the 17th Annual ACM Symposium on Theory of Computing,1979

4. The complexity of two-player games of incomplete information;Reif;J. Comp. Sys. Sci.,1984

5. G.L. Peterson, J.H. Reif and S. Azhar, Decision algorithms for multiplayer noncooperative games of incomplete information, Computers Math. Applic. (to appear); http://www.cs.duke.edu/~reif/paper/games/alg/alg.pdf.

Cited by 73 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths;ACM Transactions on Computation Theory;2024-09-05

2. Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study;Journal of Automated Reasoning;2024-07-24

3. Function Synthesis for Maximizing Model Counting;Lecture Notes in Computer Science;2023-12-30

4. A Resolution Proof System for Dependency Stochastic Boolean Satisfiability;Journal of Automated Reasoning;2023-08-03

5. Synthesis with Explicit Dependencies;2023 Design, Automation & Test in Europe Conference & Exhibition (DATE);2023-04