Open AccessHeuristics for the deterministic bidding problem
Author(s) -
Amy Greenwald,
Victor Naroditskiy
Publication year - 2006
Publication title -
acm sigecom exchanges
Language(s) - English
Resource type - Journals
ISSN - 1551-9031
DOI - 10.1145/1150735.1150740
Subject(s) - bidding , heuristics , common value auction , computer science , competition (biology) , mathematical optimization , suite , set (abstract data type) , focus (optics) , clearing , operations research , microeconomics , economics , mathematics , programming language , history , ecology , physics , archaeology , optics , finance , biology
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom