A path-following procedure to find a proper equilibrium of finite games
暂无分享,去创建一个
[1] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .
[2] M. Fiedler,et al. Some generalizations of positive definiteness and monotonicity , 1966 .
[3] Robert Wilson,et al. Computing Equilibria of N-Person Games , 1971 .
[4] J. Rosenmüller. On a Generalization of the Lemke–Howson Algorithm to Noncooperative N-Person Games , 1971 .
[5] R. Selten. Reexamination of the perfectness concept for equilibrium points in extensive games , 1975, Classics in Game Theory.
[6] R. Myerson. Refinements of the Nash equilibrium concept , 1978 .
[7] Yoshitsugu Yamamoto,et al. A unifying model based on retraction for fixed point algorithms , 1984, Math. Program..
[8] J. Mertens,et al. ON THE STRATEGIC STABILITY OF EQUILIBRIA , 1986 .
[9] E. Damme. Stability and perfection of Nash equilibria , 1987 .
[10] Yoshitsugu Yamamoto,et al. A PATH FOLLOWING ALGORITHM FOR STATIONARY POINT PROBLEMS , 1987 .
[11] Dolf Talman,et al. A Simplicial Algorithm for Stationary Point Problems on Polytopes , 1989, Math. Oper. Res..
[12] E. Allgower,et al. Numerical Continuation Methods , 1990 .
[13] Eugene L. Allgower,et al. Numerical continuation methods - an introduction , 1990, Springer series in computational mathematics.
[14] Dolf Talman,et al. A procedure for finding Nash equilibria in bi-matrix games , 1991, ZOR Methods Model. Oper. Res..
[15] Nimrod Megiddo,et al. A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems , 1991, Lecture Notes in Computer Science.
[16] A.J.J. Talman,et al. A simplicial algorithm for computing proper Nash equilibria of finite games , 1994 .