A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions.
Andrew LimJiqing TangPublished in: Australian Conference on Artificial Intelligence (2005)
Keyphrases
- combinatorial auctions
- lagrangian heuristic
- winner determination
- branch and bound
- resource allocation
- multi unit
- single item
- mechanism design
- approximation algorithms
- mixed integer
- multi item
- lagrangian relaxation
- multi unit combinatorial auctions
- set covering
- special case
- network design problem
- bidding strategies
- mathematical programming
- particle swarm optimization