Designing a Successful Adaptive Agent for TAC Ad Auction

Authors:
Meng Chang;Minghua He;Xudong Luo
Affiliations:
Aston University,United Kingdom, email: {changm2,m.he1}@aston.ac.uk;Aston University,United Kingdom, email: {changm2,m.he1}@aston.ac.uk;Nanyang Technological University, Singapore, email: xdluo@ntu.edu.sg
Venue:
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Year:
2010

Citing 5
Cited 0

An adaptive algorithm for selecting profitable keywords for search-based advertising services

EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Revenue analysis of a family of ranking rules for keyword auctions

Proceedings of the 8th ACM conference on Electronic commerce
Greedy bidding strategies for keyword auctions

Proceedings of the 8th ACM conference on Electronic commerce
An Empirical Analysis of Search Engine Advertising: Sponsored Search in Electronic Markets

Management Science
Simulation-based game theoretic analysis of keyword auctions with low-dimensional bidding strategies

UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the design and evaluation of Aston-TAC, the runner-up in the Ad Auction Game of 2009 International Trading Agent Competition. In particular, we focus on how Aston-TAC generates adaptive bid prices according to the Market-based Value Per Click and how it selects a set of keyword queries to bid on to maximise the expected profit under limited conversion capacity. Through evaluation experiments, we show that AstonTAC performs well and stably not only in the competition but also across a broad range of environments.