A game theoretic bidding agent for the ad auction game

  • Yevgeniy Vorobeychik

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

TAC/AA (ad auction game) provides a forum for research into strategic bidding in keyword auctions to try out their ideas in an independently simulated setting. We describe an agent that successfully competed in the TAC/AA game, showing in the process how to operationalize game theoretic analysis to develop a very simple, yet highly competent agent. Specifically, we use simulation-based game theory to approximate equilibria in a restricted bidding strategy space, assess their robustness in a normative sense, and argue for relative plausibility of equilibria based on an analogy to a common agent design methodology. Finally, we offer some evidence for the efficacy of equilibrium predictions based on TAC/AA tournament data.

Original languageEnglish
Title of host publicationICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence
Pages35-44
Number of pages10
StatePublished - 2011
Event3rd International Conference on Agents and Artificial Intelligence, ICAART 2011 - Rome, Italy
Duration: Jan 28 2011Jan 30 2011

Publication series

NameICAART 2011 - Proceedings of the 3rd International Conference on Agents and Artificial Intelligence
Volume2

Conference

Conference3rd International Conference on Agents and Artificial Intelligence, ICAART 2011
Country/TerritoryItaly
CityRome
Period01/28/1101/30/11

Keywords

  • Bidding agents
  • Game theory
  • Keyword auctions

Fingerprint

Dive into the research topics of 'A game theoretic bidding agent for the ad auction game'. Together they form a unique fingerprint.

Cite this