Effectiveness of Query Types and Policies for Preference Elicitation in Combinatorial Auctions

Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among the items. However, expressing oneýs preferences can require bidding on all bundles. We evaluate an approach known as inc...

Full description

Saved in:
Bibliographic Details
Published in:Autonomous Agents and Multiagent Systems: Proceedings, 3rd International Joint Conference, New York City, New York, 2004. pp. 386 - 393
Main Authors: Hudson, Benoit, Sandholm, Tuomas
Format: Conference Proceeding
Language:English
Published: Washington, DC, USA IEEE Computer Society 19.07.2004
IEEE
Series:ACM Conferences
Subjects:
Applied computing > Law, social and behavioral sciences > Economics
Computer science
Computing methodologies > Artificial intelligence > Distributed artificial intelligence > Intelligent agents
Content addressable storage
Cost accounting
Electronic commerce
Engineering profession
Marketing and sales
Mathematics of computing > Discrete mathematics > Combinatorics > Combinatorial algorithms
Pricing
Privacy
Writing
ISBN:9781581138641, 1581138644
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Combinatorial auctions, where agents can bid on bundles of items (resources, tasks, etc.), are desirable because the agents can express complementarity and substitutability among the items. However, expressing oneýs preferences can require bidding on all bundles. We evaluate an approach known as incremental preference elicitation [3] and show that as the number of items increases, the amount of information required to clear the auction is a vanishing fraction of the information collected in direct revelation mechanisms. Most of the elicitors also maintain the benefit as the number of agents increases. We prove that randomization helps, in that no deterministic elicitor is a universal revelation reducer. Finally, we present a new query type that allows agents to use anytime algorithms to give approximate answers that are refined only as needed.
Bibliography:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:9781581138641
1581138644
DOI:10.5555/1018409.1018771