论文信息 - TacTex09: a champion bidding agent for ad auctions

TacTex09: a champion bidding agent for ad auctions

In the Trading Agent Competition Ad Auctions Game, agents compete to sell products by bidding to have their ads shown in a search engine's sponsored search results. We report on the winning agent from the first (2009) competition, TacTex. TacTex operates by estimating the full game state from limited information, using these estimates to make predictions, and then optimizing its actions (daily bids, ads, and spending limits) with respect to these predictions. We present a full description of TacTex along with analysis of its performance in both the competition and controlled experiments.

Peter Stone | David Pardoe | Doran Chakraborty

[1] Joakim Eriksson,et al. Evolution of a supply chain management game for the Trading Agent Competition , 2006, AI Commun..

[2] Benjamin Leblanc Holds a Bs. Optimal Bidding on Keyword Auctions , 2010 .

[3] Peter Stone,et al. TacTex09: Champion of the First Trading Agent Competition on Ad Auctions , 2010 .

[4] R. Vohra,et al. Algorithmic Game Theory: Sponsored Search Auctions , 2007 .

[5] Andrew B. Whinston,et al. Current Issues in Keyword Auctions , 2008 .

[6] Brendan Kitts,et al. Optimal Bidding on Keyword Auctions , 2004, Electron. Mark..

[7] Michael P. Wellman,et al. Autonomous bidding agents - strategies and lessons from the trading agent competition , 2007 .