Journal of Computer and System Sciences
The complexity of elementary algebra and geometry
Journal of Computer and System Sciences
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
On mechanical quantifier elimination for elementary algebra and geometry
Journal of Symbolic Computation
A fast parallel algorithm for determining all roots of a polynomial with real roots
SIAM Journal on Computing
Consistent conditional in noncooperative game theory
International Journal of Game Theory
Designing programs that check their work
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
An Introduction to Proving the Correctness of Programs
ACM Computing Surveys (CSUR)
A Proof System for Communicating Sequential Processes
ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming
Communications of the ACM
Proving Programs to be Correct
IEEE Transactions on Computers
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Algebraic cell decomposition in NC
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
A new algebraic method for robot motion planning and real geometry
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
A faster PSPACE algorithm for deciding the existential theory of the reals
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Hi-index | 0.09 |
This paper presents algorithms for finding equilibria of mixed strategy in multistage noncooperative games of incomplete information (like probabilistic blindfold chess, where at every opportunity a player can perform different moves with some probability). These algorithms accept input games in extensive form. Our main result is an algorithm for computing aeguential equilibrium, which is the most widely accepted notion of equilibrium (for mixed strategies of noncooperative probabilistic games) in mainstream economic game theory. Previously, there were no known algorithms for computing sequential equilibria strategies (except for the special case of single stage games). The computational aspects of passage from a recursive presentation of a game to its extensive form are also discussed. For nontrivial inputs the concatenation of this procedure with the equilibrium computation is time intensive, but has low spatial requirements. Given a recursively represented game, with a position space bound S(n) and a log space computable next move relation, we can compute an example mixed strategy satisfying the sequential equilibria condition, all in space bound O(S(n)^2), Furthermore, in space O(S(n)^3), we can compute the connected components of mixed strategies satisfying sequential equilibria.