loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2 (AAMAS'04)
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
New York City, New York, USA
July 19-July 23
ISBN: 0-7695-2092-8
Eugene Nudelman, Stanford University
Jennifer Wortman, Stanford University
Yoav Shoham, Stanford University
Kevin Leyton-Brown, University of British Columbia
We present GAMUT^1, a suite of game generators designed for testing game-theoretic algorithms. We explain why such a generator is necessary, offer a way of visualizing relationships between the sets of games supported by GAMUT, and give an overview of GAMUT?s architecture. We highlight the importance of using comprehensive test data by benchmarking existing algorithms. We show surprisingly large variation in algorithm performance across different sets of games for two widely-studied problems: computing Nash equilibria and multiagent learning in repeated games.
Citation:
Eugene Nudelman, Jennifer Wortman, Yoav Shoham, Kevin Leyton-Brown, "Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms," aamas, vol. 2, pp.880-887, Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2 (AAMAS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.