Zinkevich, M.; Blum, A.; and Sandholm, T. 2003. On polynomial-time preference elicitation with value queries. In ACM-EC, 176--185.  Home/Search Document Details and Download
Summary ACM TOC Related Articles Check |
This paper is cited in the following contexts:
Combinatorial Auctions with k-wise Dependent Valuations - Conitzer, Sandholm, Santi (2005) (1 citation) Self-citation (Sandholm) (Correct)
No context found.
Zinkevich, M.; Blum, A.; and Sandholm, T. 2003. On polynomial-time preference elicitation with value queries. In ACM-EC, 176--185.
Preference Estimation and Query Learning - Blum, Jackson, al. (2004) Self-citation (Zinkevich Blum Sandholm) (Correct)
No context found.
Martin Zinkevich, Avrim Blum, and Tuomas Sandholm. On polynomial-time preference elicitation with value queries. In Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pages 176--185, San Diego, CA, 2003.
Communication Complexity of Common Voting Rules - Conitzer, Sandholm (2005) Self-citation (Sandholm) (Correct)
No context found.
Martin Zinkevich, Avrim Blum, and Tuomas Sandholm. On polynomial-time preference elicitation with value queries. In Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pages 176--185, 2003.
Effectiveness of Query Types and Policies for Preference.. - Hudson, Sandholm (2004) (1 citation) Self-citation (Sandholm) (Correct)
No context found.
M. Zinkevich, A. Blum, and T. Sandholm. On polynomial-time preference elicitation with value queries. ACM-EC, 2003.
Using Value Queries in Combinatorial Auctions - Beno Hudson Tuomas (2003) (3 citations) Self-citation (Sandholm) (Correct)
No context found.
Martin Zinkevich, Avrim Blum, and Tuomas Sandholm. On polynomial-time preference elicitation with value queries. To appear ACM-EC, 2003.
Towards a Characterization of Polynomial - Preference Elicitation With Self-citation (Sandholm) (Correct)
No context found.
M. Zinkevich, A. Blum, T. Sandholm, \On Polynomial-Time Preference Elicitation with Value Queries", Proc. ACM Conference on Electronic Commerce (EC), pp. 176-185, 2003.
Preference Elicitation and Query Learning - Blum, Jackson, Sandholm, Zinkevich (2003) (4 citations) Self-citation (Zinkevich Blum Sandholm) (Correct)
No context found.
Zinkevich, M., Blum, A., Sandholm, T.: On polynomial-time preference elicitation with value queries. In: Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), San Diego, CA (2003)
Automated Mechanism Design: A New Application Area for Search.. - Sandholm (2003) (2 citations) Self-citation (Sandholm) (Correct)
No context found.
Martin Zinkevich, Avrim Blum, and Tuomas Sandholm. On polynomial-time preference elicitation with value queries. In Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), pages 176--185, San Diego, CA, 2003.
Applying Learning Algorithms to Preference Elicitation - Lahaie, Parkes (2004) (4 citations) (Correct)
No context found.
M. Zinkevich, A. Blum, and T. Sandholm. On polynomial-time preference elicitation with value-queries. In Proc. 4th ACM Conference on Electronic Commerce (ACM-EC), San Diego, CA, June 2003.
Applying Learning Algorithms to Preference Elicitation in.. - Lahaie, Parkes (2004) (4 citations) (Correct)
No context found.
Martin Zinkevich, Avrim Blum, and Tuomas Sandholm. On polynomial-time preference elicitation with value-queries. In Proc. 4th ACM Conference on Electronic Commerce (ACM-EC), San Diego, CA, June 2003. 19
Making Markets and Democracy Work: A Story of Incentives and.. - Sandholm (2003) (3 citations) (Correct)
No context found.
Martin Zinkevich, Avrim Blum, and Tuomas Sandholm. On polynomial-time preference elicitation with value queries. In Proceedings of the ACM Conference on Electronic Commerce (ACM-EC), San Diego, CA, 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC