An Efficient Search Technique Using A Lower Bound Heuristic For Maximal Revenue Determination in Combinatorial Auctions.
Merlin NandyAmbuj MahantiPublished in: IICAI (2003)
Keyphrases
- combinatorial auctions
- lower bound
- search algorithm
- optimal solution
- set covering
- auction mechanisms
- search strategies
- upper bound
- winner determination
- resource allocation
- search strategy
- lower and upper bounds
- approximation algorithms
- branch and bound
- search space
- social welfare
- single item
- np hard
- dynamic programming
- special case
- multi unit
- tabu search
- particle swarm optimization
- simulated annealing
- combinatorial optimization
- metaheuristic
- multiple criteria
- multi item
- false name proof
- multi unit combinatorial auctions