A parallel approximation algorithm for positive linear programming
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computationally Manageable Combinational Auctions
Management Science
Truth revelation in approximately efficient combinatorial auctions
Proceedings of the 1st ACM conference on Electronic commerce
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Towards a universal test suite for combinatorial auction algorithms
Proceedings of the 2nd ACM conference on Electronic commerce
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
An Algorithm for Optimal Winner Determination in Combinatorial Auctions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Some Tractable Combinatorial Auctions
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Global Optimization Using Local Information with Applications to Flow Control
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Fast approximation algorithms for fractional packing and covering problems
Fast approximation algorithms for fractional packing and covering problems
The Communication Complexity of Approximate Set Packing and Covering
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Truthful approximation mechanisms for restricted combinatorial auctions: extended abstract
Eighteenth national conference on Artificial intelligence
Incentive compatible multi unit combinatorial auctions
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Combinatorial Auction-Based Protocols for Resource Allocation in Grids
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 13 - Volume 14
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Economic metaphors for solving intrafirm allocation problems: what does a market buy us?
Decision Support Systems
A Heuristic for Winner Determination in Rule-Based Combinatorial Auctions
INFORMS Journal on Computing
The Landscape of Electronic Market Design
Management Science
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
Proceedings of the 8th ACM conference on Electronic commerce
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)
Enacting agent-based services for automated procurement
Engineering Applications of Artificial Intelligence
An optimal multiprocessor combinatorial auction solver
Computers and Operations Research
Exchange market for complex commodities: search for optimal matches
Journal of Experimental & Theoretical Artificial Intelligence
Single-value combinatorial auctions and algorithmic implementation in undominated strategies
Journal of the ACM (JACM)
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
Efficient Grid Task-Bundle Allocation Using Bargaining Based Self-Adaptive Auction
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
A q-learning based adaptive bidding strategy in combinatorial auctions
Proceedings of the 11th International Conference on Electronic Commerce
Combinatorial auctions with structured item graphs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Solving Truckload Procurement Auctions Over an Exponential Number of Bundles
Transportation Science
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
Using messy genetic algorithms for solving the winner determination problem
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
An experimental analysis of biased parallel greedy approximation for combinatorial auctions
International Journal of Intelligent Information and Database Systems
Auctions and bidding: A guide for computer scientists
ACM Computing Surveys (CSUR)
An adaptive bidding strategy for combinatorial auction-based resource allocation in dynamic markets
PRICAI'10 Proceedings of the 11th Pacific Rim international conference on Trends in artificial intelligence
A combinatorial auction negotiation protocol for time-restricted group decisions
ICAIS'11 Proceedings of the Second international conference on Adaptive and intelligent systems
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
Accelerating vickrey payment computation in combinatorial auctions for an airline alliance
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Algorithms for distributed winner determination in combinatorial auctions
AMEC'05 Proceedings of the 2005 international conference on Agent-Mediated Electronic Commerce: designing Trading Agents and Mechanisms
An experimental study of the misdirection algorithm for combinatorial auctions
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
A new primal-dual genetic algorithm: case study for the winner determination problem
EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
A genetic algorithm hybridized with the discrete lagrangian method for trap escaping
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Future Generation Computer Systems
PRIMA'11 Proceedings of the 14th international conference on Agent Based Simulation for a Sustainable Society and Multi-agent Smart Computing
Combinatorial auction-based allocation of virtual machine instances in clouds
Journal of Parallel and Distributed Computing
WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 03
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
On bidding algorithms for a distributed combinatorial auction
Multiagent and Grid Systems
Hi-index | 0.00 |
We propose a heuristic for allocation in combinatorial auctions. We first run an approximation algorithm on the linear programming relaxation of the combinatorial auction. We then run a sequence of greedy algorithms, starting with the order on the bids determined by the approximate linear program and continuing in a hill-climbing fashion using local improvements in the order of bids. We have implemented the algorithm and have tested it on the complete corpus of instances provided by Vohra and de Vries as well as on instances drawn from the distributions of Leyton-Brown, Pearson, and Shoham. Our algorithm typically runs two to three orders of magnitude faster than the reported running times of Vohra and de Vries, while achieving an average approximation error of less than 1%. This algorithm can provide, in less than a minute of CPU time, excellent solutions for problems with over 1000 items and 10,000 bids. We thus believe that combinatorial auctions for most purposes face no practical computational hurdles.