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 Efficient Scheduling of Non-Periodic Tasks in Hard Real-Time Systems
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
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
Adaptive Memory Allocations in Clusters to Handle Unexpectedly Large Data-Intensive Jobs
IEEE Transactions on Parallel and Distributed Systems
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
An Efficient Fault-Tolerant Distributed Channel Allocation Algorithm for Cellular Networks
IEEE Transactions on Mobile Computing
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
Node Cooperation in Hybrid Ad Hoc Networks
IEEE Transactions on Mobile Computing
Instantiating the contingent bids model of truthful interdependent value auctions
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
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
Mechanism design for multi-agent meeting scheduling
Web Intelligence and Agent Systems
A complex adaptive system based on squirrels behaviors for distributed resource allocation
Web Intelligence and Agent Systems
IEEE Transactions on Parallel and Distributed Systems
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
Active Queue Management for Fair Resource Allocation in Wireless Networks
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing
IEEE Transactions on Parallel and Distributed 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
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
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
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
Toward a VCG-Like Approximate Mechanism for Large-Scale Multi-unit Combinatorial Auctions
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
PRIMA'11 Proceedings of the 14th international conference on Agent Based Simulation for a Sustainable Society and Multi-agent Smart Computing
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Hi-index | 0.00 |
Considering emerging demands for auction based efficient resource allocations, the ability to complete an auction within a fine-grained time period without loss of allocation efficiency is in strong demand. Recently, an algorithm has been proposed to obtain near-optimal solutions for winner determination problem on combinatorial auctions within a very short computation time. However, it is demanded to analyse and clarify the main factor of such an excellent performance of the algorithm. Also, for practical use, there are demands to clarify the actual implementation-level performance of the algorithm compared to major commercial-level generic problem solvers. In this paper, we show an analysis about performance issues of biased parallel greedy updating approach in various experimental settings. Furthermore, we show that the algorithm has a certain advantage to solve a kind of large-size high-complexity problems when it is compared to a latest commercial-level implementation of generic LP solver through various experiments.