Market-oriented programming: some early lessons
Market-based control
Computationally Manageable Combinational Auctions
Management Science
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
Economic dynamics of agents in multiple auctions
Proceedings of the fifth international conference on Autonomous agents
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
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
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
Algorithm Design for Agents which Participate in Multiple Simultaneous Auctions
Agent-Mediated Electronic Commerce III, Current Issues in Agent-Based Electronic Commerce Systems (includes revised papers from AMEC 2000 Workshop)
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Combinatorial Auctions: A Survey
INFORMS Journal on Computing
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
Methods for task allocation via agent coalition formation
Artificial Intelligence
Bidding algorithms for a distributed combinatorial auction
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality
Autonomous Agents and Multi-Agent Systems
Auctions and bidding: A guide for computer scientists
ACM Computing Surveys (CSUR)
On bidding algorithms for a distributed combinatorial auction
Multiagent and Grid Systems
| Hi-index | 0.00 |
The problem of optimal winner determination in combinatorial auctions consists of finding the set of bids that maximize the revenue for the sellers. Various solutions exist for solving this problem but they are all centralized. That is, they assume that all bids are sent to a centralized auctioneer who then determines the winning set of bids. In this paper we introduce the problem of distributed winner determination in combinatorial auctions which eliminates the centralized auctioneer. We present a set of distributed search-based algorithms for solving this problem and study their relative tradeoffs.