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
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
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
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions
WECWIS '02 Proceedings of the Fourth IEEE International Workshop on Advanced Issues of E-Commerce and Web-Based Information Systems (WECWIS'02)
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
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
An Approximate Algorithm for Resource Allocation Using Combinatorial Auctions
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
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)
Periodical Resource Allocation Using Approximated Combinatorial Auctions
IAT '07 Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Sequential auctions for the allocation of resources with complementarities
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Taming the computational complexity of combinatorial auctions: optimal and approximate approaches
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Sequential bundle-bid single-sale auction algorithms for decentralized control
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
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
Hi-index | 0.00 |
Combinatorial auctions provide suitable mechanisms for efficient allocation of resources to self-interested agents. Considering ubiquitous computing scenarios, the ability to complete an auction within a fine-grained time period without loss of allocation efficiency is in strong demand. Furthermore, to achieve such scenarios, it is very important to handle a large number of bids in an auction. Recently, we proposed an algorithm to obtain sufficient quality of winners in very short time. However, it is demanded to analyze which factor is mainly affected to obtain such a good performance. Also it is demanded to clarify the actual implementation-level performance of the algorithm compared to a major commercial-level generic problem solver. In this paper, we show our parallel greedy updating approach contributes its better performance. Furthermore, we show our approach has a certain advantage compared to a latest commercial-level implementation of generic LP solver through various experiments.