Computation of equilibria in noncooperative games
From MaRDI portal
Publication:815274
DOI10.1016/j.camwa.2005.02.015zbMath1121.91006OpenAlexW1996125498MaRDI QIDQ815274
John H. Reif, S. Azhar, Andrew McLennan
Publication date: 16 February 2006
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2005.02.015
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of two-player games of incomplete information
- Games against nature
- The complexity of elementary algebra and geometry
- On mechanical quantifier elimination for elementary algebra and geometry
- Consistent conditional systems in noncooperative game theory
- A proof technique for communicating sequential processes
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- A global theory of games. I: The 2-person game
- An axiomatic proof technique for parallel programs
- Decision algorithms for multiplayer noncooperative games of incomplete information
- Probabilistic game automata
- Rationalizable Strategic Behavior and the Problem of Perfection
- Rationalizable Strategic Behavior
- Justifiable Beliefs in Sequential Equilibrium
- A Refinement of Sequential Equilibrium
- A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots
- A Proof System for Communicating Sequential Processes
- Alternation
- Sequential Equilibria
- On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae
- Fast Parallel Matrix Inversion Algorithms
- The knowledge complexity of interactive proof-systems
- On the Strategic Stability of Equilibria
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- An axiomatic basis for computer programming
- Formalization of Properties of Functional Programs
- Proving Programs to be Correct
- Lower bounds for multiplayer noncooperative games of incomplete information
