Computationally Manageable Combinational Auctions
Management Science
eMediator: a next generation electronic commerce server
AGENTS '00 Proceedings of the fourth international conference on Autonomous agents
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
Computationally feasible VCG mechanisms
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
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
Mechanism Design for Resource Bounded Agents
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
The exponentiated subgradient algorithm for heuristic Boolean programming
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Bidding languages for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
ICE: an iterative combinatorial exchange
Proceedings of the 6th ACM conference on Electronic commerce
Computationally-efficient combinatorial auctions for resource allocation in weakly-coupled MDPs
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Learning user preferences for sets of objects
ICML '06 Proceedings of the 23rd international conference on Machine learning
A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
Management Science
On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition
Proceedings of the 8th ACM conference on Electronic commerce
Combinatorial resource scheduling for multiagent MDPs
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Winner determination in combinatorial auctions with logic-based bidding languages
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3
Matrix Bidding in Combinatorial Auctions
Operations Research
Expressive commerce and its application to sourcing
IAAI'06 Proceedings of the 18th conference on Innovative applications of artificial intelligence - Volume 2
Combinatorial auctions with structured item graphs
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
DD-PREF: a language for expressing preferences over sets
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
An expressive auction design for online display advertising
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Resource allocation among agents with MDP-induced preferences
Journal of Artificial Intelligence Research
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
Compactly representing utility functions using weighted goals and the max aggregator
Artificial Intelligence
Reduction of economic inequality in combinatorial domains
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
Hi-index | 0.00 |
Combinatorial auctions provide a valuable mechanism for the allocation of goods in settings where buyer valuations exhibit complex structure with respect to substitutability and complementarity. Most algorithms are designed to work with explicit "flat" bids for concrete bundles of goods. However, logical bidding languages allow the expression of complex utility functions in a natural and concise way, and have recently attracted considerable attention. Despite the power of logical languages, no current winner determination algorithms exploit the specific structure of logically specified bids to solve problems more effectively. In this paper, we describe techniques to do just this. Specifically, we propose a direct integer program (IP) formulation of the winner determination problem for bids in the LGB logical language. This formulation is linear in the size of the problem and can be solved effectively using standard optimization packages. We compare this formulation and its solution time to those of the corresponding set of flat bids, demonstrating the immense utility of exploiting the structure of logically expressed bids. We also consider an extension of LGB and show that these can also be solved using linear constraints.