Market-based control: a paradigm for distributed resource allocation
Market-based control: a paradigm for distributed resource allocation
An Algorithm for Optimal Winner Determination in Combinatorial Auctions
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Computationally Manageable Combinatorial Auctions
Computationally Manageable Combinatorial Auctions
Economic mechanism design for computerized agents
WOEC'95 Proceedings of the 1st conference on USENIX Workshop on Electronic Commerce - Volume 1
A brokering algorithm for cost & QoS-based winner determination in combinatorial auctions
IEA/AIE '00 Proceedings of the 13th international conference on Industrial and engineering applications of artificial intelligence and expert systems: Intelligent problem solving: methodologies and approaches
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Task Allocation in the RoboCup Rescue Simulation Domain: A Short Note
RoboCup 2001: Robot Soccer World Cup V
Approximation Algorithms for Budget-Constrained Auctions
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Algorithms for Rational Agents
SOFSEM '00 Proceedings of the 27th Conference on Current Trends in Theory and Practice of Informatics
An Efficient Approximate Algorithm for Winner Determination in Combinatorial Auctions
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Design Tradeoffs for Autonomous Trading Agents
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Effectiveness of Preference Elicitation in Combinatorial Auctions
AAMAS '02 Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems
Differential -Revelation VCG Mechanisms for Combinatorial Auctions
AAMAS '02 Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems
Bidtree Ordering in IDA* Combinatorial Auction Winner-Determination with Side Constraints
AAMAS '02 Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems
Generating Bids for Group-Related Actions in the Context of Prior Commitments
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
Exploring local search in winner determination problem
Information Technology and Management
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
Bid evaluation in combinatorial auctions: optimization and learning
Software—Practice & Experience
Combinatorial reverse auction based on revelation of Lagrangian multipliers
Decision Support Systems
Agents' bidding strategies in a combinatorial auction controlled grid environment
TADA/AMEC'06 Proceedings of the 2006 AAMAS workshop and TADA/AMEC 2006 conference on Agent-mediated electronic commerce: automated negotiation and strategy design for electronic markets
Secure combinatorial auctions by dynamic programming with polynomial secret sharing
FC'02 Proceedings of the 6th international conference on Financial cryptography
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
Combinatorial auction with minimal resource requirements
IEA/AIE'07 Proceedings of the 20th international conference on Industrial, engineering, and other applications of applied intelligent systems
Towards generic solver of combinatorial optimization problems with autonomous agents in P2P networks
ISHPC'05/ALPS'06 Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems
A new approach to detecting shill bids in e-auctions
International Journal of Intelligent Information and Database 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
Algorithms and theory of computation handbook
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
Comparing multiagent systems research in combinatorial auctions and voting
Annals of Mathematics and Artificial Intelligence
Average-case analysis of mechanism design with approximate resource allocation algorithms
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Fair Mechanisms for Recurrent Multi Unit Combinatorial Auctions
Proceedings of the 2010 conference on STAIRS 2010: Proceedings of the Fifth Starting AI Researchers' Symposium
Average-case analysis of VCG with approximate resource allocation algorithms
Decision Support Systems
Generalised Network Flows for Combinatorial Auctions
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
UAI'01 Proceedings of the Seventeenth conference on Uncertainty in artificial intelligence
Computing optimal outcomes under an expressive representation of settings with externalities
Journal of Computer and System Sciences
A lagrangian heuristic for winner determination problem in combinatorial auctions
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Multi-unit combinatorial reverse auctions with transformability relationships among goods
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Multi-unit combinatorial reverse auctions with transformability relationships among goods
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Accelerating vickrey payment computation in combinatorial auctions for an airline alliance
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Agents' bidding strategies in a combinatorial auction
MATES'06 Proceedings of the 4th German conference on Multiagent System Technologies
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 approach to detecting shill-biddable allocations in combinatorial auctions
DEECS'06 Proceedings of the Second international conference on Data Engineering Issues in E-Commerce and Services
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
Minimum satisfiability and its applications
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Optimizing with minimum satisfiability
Artificial Intelligence
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Service customization under capacity constraints: an auction-based model
Journal of Intelligent Manufacturing
On bidding algorithms for a distributed combinatorial auction
Multiagent and Grid Systems
Hi-index | 0.00 |
In combinatorial auctions, multiple goods are sold simultaneously and bidders may bid for arbitrary combinations of goods. Determining the outcome of such an auction is an optimization problem that is NP-complete in the general case. We propose two methods of overcoming this apparent intractability. The first method, which is guaranteed to be optimal, reduces running time by structuring the search space so that a modified depth-first search usually avoids even considering allocations that contain conflicting bids. Caching and pruning are also used to speed searching. Our second method is a heuristic, market-based approach. It sets up a virtual multi-round auction in which a virtual agent represents each original bid bundle and places bids, according to a fixed strategy, for each good in that bundle. We show through experiments on synthetic data that (a) our first method finds optimal allocations quickly and offers good anytime performance, and (b) in many cases our second method, despite lacking guarantees regarding optimality or running time, quickly reaches solutions that are nearly optimal.