Using value queries in combinatorial auctions

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2003, Pages 226-227

  Hudson, Benoît ^a   Sandholm, Tuomas ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Combinatorial auctions; Electronic auctions; Preference elicitation

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS;

COMBINATORIAL AUCTIONS; ELECTRONIC AUCTIONS; UNIVERSAL REVELATION REDUCER;

ELECTRONIC COMMERCE;

EID: 0242539856     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/779928.779971     Document Type: Conference Paper

References (7)

1. Wolfram Conen and Tuomas Sandholm. Preference elicitation in combinatorial auctions: Extended abstract. In ACM-EC, pp. 256-259, 2001. A more detailed description of the algorithmic aspects appeared in the IJCAI-2001 Workshop on Economic Agents, Models, and Mechanisms, pp. 71-80.
2. Wolfram Conen and Tuomas Sandholm. Differential-revelation VCG mechanisms for combinatorial auctions. In AAMAS-02 workshop on Agent-Mediated Electronic Commerce, 2002.
3. Benoit Hudson and Tuomas Sandholm. Effectiveness of preference elicitation in combinatorial auctions. In AAMAS-02 workshop on Agent-Mediated Electronic Commerce, 2002. Extended version: Carnegie Mellon University, Computer Science Department, CMU-CS-02,124, March. Also: Stanford Institute for Theoretical Economics workshop (SITE-02).
4. Noam Nisan and Ilya Segal. The communication complexity of efficient allocation problems Draft. March, 2002.
5. David C Parkes. eBundle: An efficient ascending price bundle auction. In ACM-EC, pp. 148-157, 1999.
6. Trey Smith, Tuomas Sandholm, and Reid Simmons. Constructing and clearing combinatorial exchanges using preference elicitation. In AAAI-02 workshop on Preferences in AI and CP: Symbolic Approaches, 2002.
7. Martin Zinkevich, Avrim Blum, and Tuomas Sandholm. On polynomial-time preference elicitation with value queries. To appear ACM-EC, 2003.