Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
An efficient approximate allocation algorithm for combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Solving Combinatorial Auctions Using Stochastic Local Search
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem
HICSS '05 Proceedings of the Proceedings of the 38th Annual Hawaii International Conference on System Sciences (HICSS'05) - Track 3 - Volume 03
ICE: an iterative combinatorial exchange
Proceedings of the 6th ACM conference on Electronic commerce
Combinatorial Auctions
Truthful and Near-Optimal Mechanism Design via Linear Programming
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An improved approximation algorithm for combinatorial auctions with submodular bidders
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
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
Winner Price Monotonicity for Approximated Combinatorial Auctions
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 03
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
An experimental analysis of biased parallel greedy approximation for combinatorial auctions
International Journal of Intelligent Information and Database Systems
On bidding algorithms for a distributed combinatorial auction
Multiagent and Grid Systems
| Hi-index | 0.00 |
Combinatorial auctions, one of the most popular market mechanisms, have a huge effect on electronic markets and political strategies. In real scenarios, since the auction mechanism has to clear the market very frequently, actually there is not enough time to compute exact optimal winners. Some works try to achieve approximate solutions in winner determination. In this paper, we compare four approximation algorithms, and reveal how those algorithms work better on which settings. Especially, we focused on comparing them in the setting of that has many number of bids but only a limited time period can be used for each approximation.