Structure theorems for game trees
暂无分享,去创建一个
Kohlberg and Mertens [Kohlberg, E. & Mertens, J. (1986) Econometrica 54, 1003–1039] proved that the graph of the Nash equilibrium correspondence is homeomorphic to its domain when the domain is the space of payoffs in normal-form games. A counterexample disproves the analog for the equilibrium outcome correspondence over the space of payoffs in extensive-form games, but we prove an analog when the space of behavior strategies is perturbed so that every path in the game tree has nonzero probability. Without such perturbations, the graph is the closure of the union of a finite collection of its subsets, each diffeomorphic to a corresponding path-connected open subset of the space of payoffs. As an application, we construct an algorithm for computing equilibria of an extensive-form game with a perturbed strategy space, and thus approximate equilibria of the unperturbed game.
[1] S. Smale. Convergent process of price adjust-ment and global newton methods , 1976 .
[2] J. Mertens,et al. ON THE STRATEGIC STABILITY OF EQUILIBRIA , 1986 .
[3] Ennio Stacchetti,et al. A Bound on the Proportion of Pure Strategy Equilibria in Generic Games , 1993, Math. Oper. Res..
[4] B. Stengel,et al. Efficient Computation of Behavior Strategies , 1996 .
[5] Robert Wilson,et al. Direct proofs of generic finiteness of nash equilibrium outcomes , 2001 .