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

Learn More →

Heuristics for the deterministic bidding problem

Heuristics for the deterministic bidding problem We study a suite of heuristics that were designed for bidding in the simultaneous auctions that characterize the Trading Agent Competition (TAC) Travel Game. At a high-level, the design of many successful TAC agents can be summarized as: (i) predict: build a model of the auctions' clearing prices, and (ii) optimize: solve for an (approximately) optimal set of bids, given this model. We focus on the optimization piece of this design. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM SIGecom Exchanges Association for Computing Machinery

Heuristics for the deterministic bidding problem

ACM SIGecom Exchanges , Volume 6 (1) – Jun 1, 2006

Loading next page...
 
/lp/association-for-computing-machinery/heuristics-for-the-deterministic-bidding-problem-dp0q2s1aJK
Publisher
Association for Computing Machinery
Copyright
Copyright © 2006 by ACM Inc.
ISSN
1551-9031
DOI
10.1145/1150735.1150740
Publisher site
See Article on Publisher Site

Abstract

We study a suite of heuristics that were designed for bidding in the simultaneous auctions that characterize the Trading Agent Competition (TAC) Travel Game. At a high-level, the design of many successful TAC agents can be summarized as: (i) predict: build a model of the auctions' clearing prices, and (ii) optimize: solve for an (approximately) optimal set of bids, given this model. We focus on the optimization piece of this design.

Journal

ACM SIGecom ExchangesAssociation for Computing Machinery

Published: Jun 1, 2006

There are no references for this article.