Information Processing Letters
Small-bias probability spaces: efficient constructions and applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Learning read-once formulas with queries
Journal of the ACM (JACM)
Computationally Manageable Combinational Auctions
Management Science
iBundle: an efficient ascending price bundle auction
Proceedings of the 1st ACM conference on Electronic commerce
Bidding and allocation in combinatorial auctions
Proceedings of the 2nd ACM conference on Electronic commerce
AkBA: a progressive, anonymous-price combinatorial auction
Proceedings of the 2nd ACM conference on Electronic commerce
Computationally feasible VCG mechanisms
Proceedings of the 2nd ACM conference on Electronic commerce
Preference elicitation in combinatorial auctions
Proceedings of the 3rd ACM conference on Electronic Commerce
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Truth revelation in approximately efficient combinatorial auctions
Journal of the ACM (JACM)
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
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
On polynomial-time preference elicitation with value queries
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)
Applying learning algorithms to preference elicitation
EC '04 Proceedings of the 5th ACM conference on Electronic commerce
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
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
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
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 Journal of Machine Learning Research
Eliciting single-peaked preferences using comparison queries
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
A modular framework for iterative combinatorial auctions
ACM SIGecom Exchanges
Online feature elicitation in interactive optimization
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Combinatorial auctions with k-wise dependent valuations
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Eliciting single-peaked preferences using comparison queries
Journal of Artificial Intelligence Research
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
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
AutoMed: an automated mediator for multi-issue bilateral negotiations
Autonomous Agents and Multi-Agent Systems
Querying the semantic web with preferences
ISWC'06 Proceedings of the 5th international conference on The Semantic Web
Annotating preferences in negotiation dialogues
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
Algorithmic Solutions for Envy-Free Cake Cutting
Operations Research
| Hi-index | 0.00 |
In this paper we explore the relationship between "preference elicitation", a learning-style problem that arises in combinatorial auctions, and the problem of learning via queries studied in computational learning theory. Preference elicitation is the process of asking questions about the preferences of bidders so as to best divide some set of goods. As a learning problem, it can be thought of as a setting in which there are multiple target concepts that can each be queried separately, but where the goal is not so much to learn each concept as it is to produce an "optimal example". In this work, we prove a number of similarities and differences between two-bidder preference elicitation and query learning, giving both separation results and proving some connections between these problems.