Using tabu best-response search to find pure strategy nash equilibria in normal form games
暂无分享,去创建一个
[1] Michael P. Wellman,et al. Exploring bidding strategies for market-based scheduling , 2003, EC '03.
[2] Shou-De Lin,et al. Designing the Market Game for a Trading Agent Competition , 2001, IEEE Internet Comput..
[3] R. McKelvey,et al. Computation of equilibria in finite games , 1996 .
[4] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[5] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..
[6] Robert Wilson,et al. A global Newton method to compute Nash equilibria , 2003, J. Econ. Theory.
[7] Michael P. Wellman,et al. AkBA: a progressive, anonymous-price combinatorial auction , 2000, EC '00.
[8] Jie Zhong,et al. Computing price trajectories in combinatorial auctions with proxy bidding , 2004, Electron. Commer. Res. Appl..
[9] David Levine,et al. CABOB: A Fast Optimal Algorithm for Combinatorial Auctions , 2001, IJCAI.
[10] G. van der Laan,et al. Adjustment processes for finding economic equilibria , 1985 .
[11] C. E. Lemke,et al. Equilibrium Points of Bimatrix Games , 1964 .
[12] Michael P. Wellman,et al. Computing Best-Response Strategies in Infinite Games of Incomplete Information , 2004, UAI.
[13] Yoav Shoham,et al. Run the GAMUT: a comprehensive approach to evaluating game-theoretic algorithms , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..
[14] D. Werra,et al. Tabu search: a tutorial and an application to neural networks , 1989 .
[15] Ashish Sureka,et al. Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions , 2005, GECCO '05.
[16] J. Nash. Equilibrium Points in N-Person Games. , 1950, Proceedings of the National Academy of Sciences of the United States of America.
[17] Rajarshi Das,et al. Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium , 2003, AMEC.
[18] Sven de Vries,et al. Combinatorial Auctions: A Survey , 2003, INFORMS J. Comput..
[19] Roger B. Myerson,et al. Game theory - Analysis of Conflict , 1991 .
[20] Lawrence M. Ausubel,et al. Ascending Auctions with Package Bidding , 2002 .
[21] David C. Parkes,et al. Iterative Combinatorial Auctions: Theory and Practice , 2000, AAAI/IAAI.
[22] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[23] Andrew McLennan,et al. Gambit: Software Tools for Game Theory , 2006 .
[24] Fred W. Glover,et al. Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..
[25] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..