论文信息 - On the computability of Nash equilibria - 字舞流文

On the computability of Nash equilibria

[1] Some Results on the Constructive Existence of Equilibrium in Finite Games , 1996 .

[2] Kislaya Prasad. Computability and randomness of Nash equilibrium in infinite games , 1991 .

[3] William R. Zame,et al. The Algebraic Geometry of Games and the Tracing Procedure , 1991 .

[4] Ken Binmore,et al. Modeling Rational Players: Part II , 1987, Economics and Philosophy.

[5] Ken Binmore,et al. Modeling rational players I , 1987 .

[6] Arto Salomaa,et al. Computation and Automata , 1984 .

[7] James P. Jones. Universal Diophantine Equation , 1982, J. Symb. Log..

[8] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .

[9] G. Debreu. Existence of competitive equilibrium , 1982 .

[10] Michael O. Rabin,et al. 6. EFFECTIVE COMPUTABILITY OF WINNING STRATEGIES , 1958 .

[11] I. Glicksberg. A FURTHER GENERALIZATION OF THE KAKUTANI FIXED POINT THEOREM, WITH APPLICATION TO NASH EQUILIBRIUM POINTS , 1952 .

[12] A. Tarski. A Decision Method for Elementary Algebra and Geometry , 2023 .