Proceedings of the 3rd international workshop on Data enginering issues in E-commerce and services: In conjunction with ACM Conference on Electronic Commerce (EC '07)
Performance Analysis about Parallel Greedy Approximation on Combinatorial Auctions
PRIMA '08 Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems
Fast Partial Reallocation in Combinatorial Auctions for Iterative Resource Allocation
Agent Computing and Multi-Agent Systems
Toward a large scale E-market: a greedy and local search based winner determination
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
An experimental analysis of biased parallel greedy approximation for combinatorial auctions
International Journal of Intelligent Information and Database Systems
A lagrangian heuristic for winner determination problem in combinatorial auctions
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the problem. We study the existing exact and non-exact approaches to the problem and analyze the performance of those approaches. We compared our heuristic with the leading exact method CPLEX 8.0 solver and another non-exact algorithms Casanova using both the CATS test sets and test cases believed more difficult than CATS. Results show that the method is competitive with CPLEX 8.0 and obtains near optimal solutions for the CATS cases and up to 15% and 40% better solutions compared with CPLEX and Casanova, respectively, when the other instances were used.