An experimental analysis of biased parallel greedy approximation for combinatorial auctions.
Naoki FukutaTakayuki ItoPublished in: Int. J. Intell. Inf. Database Syst. (2010)
Keyphrases
- combinatorial auctions
- approximation algorithms
- winner determination
- resource allocation
- mechanism design
- single item
- multi item
- multi unit
- multi unit combinatorial auctions
- greedy algorithm
- np hard
- auction mechanisms
- special case
- search algorithm
- bidding strategies
- set covering
- search space
- optimal solution
- auction protocol
- multi agent
- cost function