Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Computationally Manageable Combinational Auctions
Management Science
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Tabu Search
A Combinatorial Auction with Multiple Winners for Universal Service
Management Science
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
Metaheuristics: computer decision-making
Metaheuristics: computer decision-making
Using tabu best-response search to find pure strategy nash equilibria in normal form games
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Using tabu best-response search to find pure strategy nash equilibria in normal form games
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
A Computational Analysis of Linear Price Iterative Combinatorial Auction Formats
Information Systems Research
Strategic analysis with simulation-based games
Winter Simulation Conference
| Hi-index | 0.00 |
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Best response dynamics is a method of searching for pure-strategy equilibria in games that is attractive for its simplicity and scalability (relative to more analytical approaches). However, when the cost of determining the outcome of a particular set of joint strategies is high, it is impractical to compute the payoffs of all possible responses to the other players actions. Thus, we study metaheuristic approaches--genetic algorithms and tabu search in particular--to explore the strategy space. We configure the parameters of metaheuristics to adapt to the problem of finding the best response strategy and present how it can be helpful in finding Nash equilibria of combinatorial auctions which is an important solution concept in game theory.