Communications of the ACM
Learning regular sets from queries and counterexamples
Information and Computation
Learning sparse multivariate polynomials over a field with queries and counterexamples
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
An introduction to computational learning theory
An introduction to computational learning theory
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
Machine Learning
Machine Learning
Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on 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
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
Partial-revelation VCG mechanism for combinatorial auctions
Eighteenth national conference on Artificial intelligence
On polynomial-time preference elicitation with value queries
Proceedings of the 4th ACM conference on Electronic commerce
Using value queries in combinatorial auctions
Proceedings of the 4th ACM conference on Electronic commerce
Integer Programming for Combinatorial Auction Winner Determination
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Auction design with costly preference elicitation
Annals of Mathematics and Artificial Intelligence
CABOB: a fast optimal algorithm for combinatorial auctions
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
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
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
The communication cost of selfishness: ex post implementation
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
Models for Iterative Multiattribute Procurement Auctions
Management Science
Eliciting single-peaked preferences using comparison queries
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Dynamic cost-per-action mechanisms and applications to online advertising
Proceedings of the 17th international conference on World Wide Web
A modular framework for iterative combinatorial auctions
ACM SIGecom Exchanges
Automated design of scoring rules by learning from examples
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
The learnability of voting rules
Artificial Intelligence
Efficiently Generating k-Best Solutions to Procurement Auctions
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Regret-based incremental partial revelation mechanisms
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Combinatorial auctions with k-wise dependent valuations
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
ICE: an expressive iterative combinatorial exchange
Journal of Artificial Intelligence Research
Eliciting single-peaked preferences using comparison queries
Journal of Artificial Intelligence Research
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A kernel method for market clearing
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Visualizing trends in knowledge management
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
Algorithms and theory of computation handbook
Comparing multiagent systems research in combinatorial auctions and voting
Annals of Mathematics and Artificial Intelligence
On the Computational Power of Demand Queries
SIAM Journal on Computing
Optimal internet auctions with costly communication
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
| Hi-index | 0.00 |
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that learning algorithms can be used as a basis for preference elicitation algorithms. The resulting elicitation algorithms perform a polynomial number of queries. We also give conditions under which the resulting algorithms have polynomial communication. Our conversion procedure allows us to generate combinatorial auction protocols from learning algorithms for polynomials, monotone DNF, and linear-threshold functions. In particular, we obtain an algorithm that elicits XOR bids with polynomial communication.