Monotone branch-and-bound search for restricted combinatorial auctions.
John K. LaiDavid C. ParkesPublished in: EC (2012)
Keyphrases
- combinatorial auctions
- branch and bound search
- branch and bound
- winner determination
- arc consistency
- search algorithm
- mechanism design
- search tree
- search strategy
- single item
- resource allocation
- upper bound
- search heuristics
- approximation algorithms
- iterative deepening
- auction mechanisms
- mathematical programming
- special case
- lower bound
- lagrangian relaxation
- constraint satisfaction
- cutting plane algorithm
- constraint programming
- column generation
- combinatorial optimization
- worst case