An algorithm for computing the outcome of combinatorial auctions with proxy bidding.

Peter R. Wurman Gangshu Cai Jie Zhong Ashish Sureka

Published in: ICEC (2003)

Keyphrases

combinatorial auctions
objective function
np hard
dynamic programming
resource allocation
computational complexity
search space
worst case
simulated annealing
ant colony optimization
bidding strategies
cost function
optimization problems
set covering