Strategic analysis with simulation-based games

We present an overview of an emerging methodology for applying game-theoretic analysis to strategic environments described by a simulator. We first introduce the problem of solving a simulation-based game, and proceed to review convergence results and confidence bounds about game-theoretic equilibrium estimates. Next, we present techniques for approximating equilibria in simulation-based games, and close with a series of applications.

[1]  Michael P. Wellman,et al.  Stochastic Search Methods for Nash Equilibrium Approximation in Simulation-based Games , 2022 .

[2]  Michael P. Wellman,et al.  Empirical mechanism design: methods, with application to a supply-chain scenario , 2006, EC '06.

[3]  Yevgeniy Vorobeychik,et al.  Game-Theoretic Methods for Analysis of Tactical Decision-Making Using Agent-Based Combat Simulations , 2009 .

[4]  Jeffrey O. Kephart,et al.  Shopbot Economics , 2004, Autonomous Agents and Multi-Agent Systems.

[5]  Ariel Rubinstein,et al.  A Course in Game Theory , 1995 .

[6]  Michael P. Wellman,et al.  Generating trading agent strategies: Analytic and empirical methods for infinite and large games , 2005 .

[7]  Michael P. Wellman,et al.  Autonomous bidding agents - strategies and lessons from the trading agent competition , 2007 .

[8]  Michael P. Wellman,et al.  Approximate Strategic Reasoning through Hierarchical Reduction of Large Symmetric Games , 2005, AAAI.

[9]  Andrew McLennan,et al.  Gambit: Software Tools for Game Theory , 2006 .

[10]  G. Tesauro,et al.  Analyzing Complex Strategic Interactions in Multi-Agent Systems , 2002 .

[11]  Norman M. Sadeh,et al.  The supply chain trading agent competition , 2005, Electron. Commer. Res. Appl..

[12]  Jeffrey O. Kephart,et al.  Shopbot Economics , 1999, AGENTS '99.

[13]  Michael P. Wellman,et al.  The 2001 trading agent competition , 2002, Electron. Mark..

[14]  Michael P. Wellman,et al.  Searching for approximate equilibria in empirical games , 2008, AAMAS.

[15]  E. Maasland,et al.  Auction Theory , 2021, Springer Texts in Business and Economics.

[16]  Michael P. Wellman,et al.  Stronger CDA strategies through empirical game-theoretic analysis and reinforcement learning , 2009, AAMAS.

[17]  Michael P. Wellman,et al.  Bidding Strategies for Simultaneous Ascending Auctions , 2008 .

[18]  Rajarshi Das,et al.  Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium , 2003, AMEC.

[19]  Pierre L'Ecuyer,et al.  Efficiency improvement and variance reduction , 1994, Proceedings of Winter Simulation Conference.

[20]  Michel Gendreau,et al.  Combinatorial auctions , 2007, Ann. Oper. Res..

[21]  Michael P. Wellman,et al.  Generalization risk minimization in empirical game models , 2009, AAMAS.

[22]  Michael P. Wellman,et al.  Empirical game-theoretic analysis of the TAC Supply Chain game , 2007, AAMAS '07.

[23]  Shou-De Lin,et al.  Designing the Market Game for a Trading Agent Competition , 2001, IEEE Internet Comput..

[24]  Michael P. Wellman,et al.  STRATEGIC INTERACTIONS IN A SUPPLY CHAIN GAME , 2005, Comput. Intell..

[25]  Ashish Sureka,et al.  Applying metaheuristic techniques to search the space of bidding strategies in combinatorial auctions , 2005, GECCO '05.

[26]  Michael P. Wellman,et al.  An analysis of the 2004 supply chain management trading agent competition , 2005, NAFIPS 2005 - 2005 Annual Meeting of the North American Fuzzy Information Processing Society.

[27]  Robert L. Smith,et al.  Adaptive search with stochastic acceptance probabilities for global optimization , 2008, Oper. Res. Lett..

[28]  P. Cramton.  Simultaneous Ascending Auctions , 2004 .

[29]  Michael P. Wellman,et al.  Learning payoff functions in infinite games , 2005, Machine Learning.

[30]  Yevgeniy Vorobeychik,et al.  Probabilistic analysis of simulation-based games , 2010, TOMC.

[31]  Yi-Ping Chang,et al.  GENERALIZED CONFIDENCE INTERVALS FOR THE LARGEST VALUE OF SOME FUNCTIONS OF PARAMETERS UNDER NORMALITY , 2000 .