A game theoretic bound for minmax regret optimization problems with interval data.
Hugo GilbertOlivier SpanjaardPublished in: CoRR (2016)
Keyphrases
- game theoretic
- minmax regret
- interval data
- optimization problems
- combinatorial optimization problems
- game theory
- shortest path problem
- evolutionary algorithm
- decision problems
- metaheuristic
- upper bound
- nash equilibrium
- lower bound
- objective function
- temporal data
- cost function
- data clustering
- benchmark problems
- knapsack problem
- multivariate data
- combinatorial optimization
- optimization criterion
- worst case
- trust model
- traveling salesman problem
- combinatorial auctions
- resource allocation problems
- directed acyclic graph
- branch and bound
- ant colony optimization
- search algorithm