Distributed Branch-and-Bound Scheme for Solving the Winner Determination Problem in Combinatorial Auctions.
Satoshi FujitaShigeaki TagashiraChen QiaoMasaya MitoPublished in: AINA (2005)
Keyphrases
- combinatorial auctions
- branch and bound
- combinatorial optimization
- winner determination
- integer programming problems
- mathematical programming
- lower bound
- search algorithm
- branch and bound algorithm
- mini bucket
- branch and bound search
- multi unit
- column generation
- upper bound
- search space
- optimal solution
- resource allocation
- single item
- approximation algorithms
- multi item
- mechanism design
- multi unit combinatorial auctions
- bnb adopt
- branch and bound procedure
- branch and bound method
- network design problem
- distributed constraint optimization
- special case
- tree search
- traveling salesman problem
- implicit enumeration
- multi agent
- max sat
- worst case
- integer program
- search strategies
- constraint satisfaction problems
- np hard
- previously solved
- bidding strategies