Computationally Manageable Combinational Auctions
Management Science
iBundle: an efficient ascending price bundle auction
Proceedings of the 1st ACM conference on Electronic commerce
AkBA: a progressive, anonymous-price combinatorial auction
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
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Iterative Combinatorial Auctions: Theory and Practice
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Preventing Strategic Manipulation in Iterative Auctions: Proxy Agents and Price-Adjustment
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Costly valuation computation in auctions
TARK '01 Proceedings of the 8th conference on Theoretical aspects of rationality and knowledge
Issues in computational Vickrey auctions
International Journal of Electronic Commerce - Special issue: Intelligent agents for electronic commerce
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Preference elicitation in combinatorial auctions
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Price-Based Information Certificates for Minimal-Revelation Combinatorial Auctions
AAMAS '02 Revised Papers from the Workshop on Agent Mediated Electronic Commerce on Agent-Mediated Electronic Commerce IV, Designing Mechanisms and Systems
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
Partial-revelation VCG mechanism for combinatorial auctions
Eighteenth national conference on Artificial intelligence
Vote elicitation: complexity and strategy-proofness
Eighteenth national conference on Artificial intelligence
A robust open ascending-price multi-unit auction protocol against false-name bids
Proceedings of the 4th ACM conference on Electronic commerce
On polynomial-time preference elicitation with value queries
Proceedings of the 4th ACM conference on Electronic commerce
Differential-revelation VCG mechanisms for combinatorial auctions
Proceedings of the 4th ACM conference on Electronic commerce
Preference elicitation in proxied multiattribute auctions
Proceedings of the 4th ACM conference on Electronic commerce
Using value queries in combinatorial auctions
Proceedings of the 4th ACM conference on Electronic commerce
Generalizing preference elicitation in combinatorial auctions
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
A new bidding framework for combinatorial e-auctions
Computers and Operations Research
Preference Elicitation and Query Learning
The Journal of Machine Learning Research
Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
(Im)Possibility of Unconditionally Privacy-Preserving Auctions
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Efficient Management of Multi-Linked Negotiation Based on a Formalized Model
Autonomous Agents and Multi-Agent Systems
A robust open ascending-price multi-unit auction protocol against false-name bids
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
On the computational power of iterative auctions
Proceedings of the 6th ACM conference on Electronic commerce
Communication complexity of common voting rules
Proceedings of the 6th ACM conference on Electronic commerce
ICE: an iterative combinatorial exchange
Proceedings of the 6th ACM conference on Electronic commerce
Auction design with costly preference elicitation
Annals of Mathematics and Artificial Intelligence
Exponential communication inefficiency of demand queries
TARK '05 Proceedings of the 10th conference on Theoretical aspects of rationality and knowledge
Generating k-best solutions to auction winner determination problems
ACM SIGecom Exchanges
Enhancing digital advertising using dynamically configurable multimedia
ICME '03 Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 2
A New and Improved Design for Multiobject Iterative Auctions
Management Science
Eliciting single-peaked preferences using comparison queries
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Pick-a-bundle: a novel bundling strategy for selling multiple items within online auctions
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Eliciting bid taker non-price preferences in (combinatorial) auctions
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Combinatorial auctions with k-wise dependent valuations
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
ICE: an expressive iterative combinatorial exchange
Journal of Artificial Intelligence Research
Making markets and democracy work: a story of incentives and computing
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Eliciting single-peaked preferences using comparison queries
Journal of Artificial Intelligence Research
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Improving efficiency in multiple-unit combinatorial auctions: Bundling bids from multiple bidders
Decision Support Systems
A robust open ascending-price multi-unit auction protocol against false-name bids
Decision Support Systems - Special issue: The fourth ACM conference on electronic commerce
Algorithms and theory of computation handbook
Combinatorial auctions in freight logistics
ICCL'11 Proceedings of the Second international conference on Computational logistics
On correctness and privacy in distributed mechanisms
AMEC'05 Proceedings of the 2005 international conference on Agent-Mediated Electronic Commerce: designing Trading Agents and Mechanisms
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Hi-index | 0.00 |
Combinatorial auctions (CAs) where bidders can bid on bundles of items can be very desirable market mechanisms when the items sold exhibit complementarity and/or substitutability, so the bidder's valuations for bundles are not additive. However, in a basic CA, the bidders may need to bid on exponentially many bundles, leading to difficulties in determining those valuations, undesirable information revelation, and unnecessary communication. In this paper we present a design of an auctioneer agent that uses topological structure inherent in the problem to reduce the amount of information that it needs from the bidders. An analysis tool is presented as well as data structures for storing and optimally assimilating the information received from the bidders. Using this information, the agent then narrows down the set of desirable (welfare-maximizing or Pareto-efficient) allocations, and decides which questions to ask next. Several algorithms are presented that ask the bidders for value, order, and rank information. A method is presented for making the elicitor incentive compatible.