Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Computationally Manageable Combinational Auctions
Management Science
AkBA: a progressive, anonymous-price combinatorial auction
Proceedings of the 2nd ACM conference on Electronic commerce
Designing the Market Game for a Trading Agent Competition
IEEE Internet Computing
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Iterative Combinatorial Auctions: Theory and Practice
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Computing best-response strategies in infinite games of incomplete information
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Exploring bidding strategies for market-based scheduling
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Simple search methods for finding a Nash equilibrium
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Searching for approximate equilibria in empirical games
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Generalization risk minimization in empirical game models
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
An algorithmic game theory study of wholesale electricity markets based on central auction
Integrated Computer-Aided Engineering - Multi-Agent Systems for Energy Management
Learning equilibria of games via payoff queries
Proceedings of the fourteenth ACM conference on Electronic commerce
Hi-index | 0.00 |
We present a new method for computing pure strategy Nash equilibria for a class of n-person games where it is computationally expensive to compute the payoffs of the players as a result of the joint actions. Previous algorithms to compute Nash equilibria are based on mathematical programming and analytical derivation, and require a complete payoff matrix as input. However, determining a payoff matrix can itself be computationally intensive, as is the case with combinatorial auctions. This paper proposes an approach, based on best-response dynamics and tabu search, that avoids the requirement that we have a complete payoff matrix upfront, and instead computes the payoffs only as they become relevant to the search. The tabu features help break best-response cycles, and allow the algorithm to find pure strategy Nash equilibria in multiplayer games where best-response would typically fail. We test the algorithm on several classes of standard and random games, and present empirical results that show the algorithm performs well and gives the designer control over the tradeoffs between search time and completeness.