Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A modular framework for iterative combinatorial auctions

A modular framework for iterative combinatorial auctions We describe a modular elicitation framework for iterative combinatorial auctions. The framework includes proxy agents, each of which can adopt an individualized bidding language to represent partial value information of a bidder. The framework leverages algorithms from query learning to elicit value information via bids as the auction progresses. The approach reduces the multi-agent elicitation problem to isolated, single-agent learning problems, with competitive equilibrium prices used to facilitate auction clearing even without complete learning. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGecom Exchanges Association for Computing Machinery

A modular framework for iterative combinatorial auctions

Lahaie, Séstien; Parkes, David C.
ACM SIGecom Exchanges , Volume 7 (2) – Jun 1, 2008
Download PDF
5 pages

Loading next page...
 
/lp/association-for-computing-machinery/a-modular-framework-for-iterative-combinatorial-auctions-BU8Z0Gff8A
Publisher
Association for Computing Machinery
Copyright
Copyright © 2008 by ACM Inc.
ISSN
1551-9031
DOI
10.1145/1399589.1399597
Publisher site
See Article on Publisher Site

Abstract

We describe a modular elicitation framework for iterative combinatorial auctions. The framework includes proxy agents, each of which can adopt an individualized bidding language to represent partial value information of a bidder. The framework leverages algorithms from query learning to elicit value information via bids as the auction progresses. The approach reduces the multi-agent elicitation problem to isolated, single-agent learning problems, with competitive equilibrium prices used to facilitate auction clearing even without complete learning.

Journal

ACM SIGecom Exchanges – Association for Computing Machinery

Published: Jun 1, 2008

There are no references for this article.