Efficient algorithms for online ad markets with time constraints

点击翻译按钮获取中文摘要

Algorithmic trading is an essential part of today's economy. This proposal in on the design and implementation of algorithmic trading in the context of ad auctions in the wireless mobile context. This work is being done in collaboration with our industrial partner Addictive Mobility, Toronto that provides cutting edge solutions for providing ad space to advertisers in the context of mobile wireless systems by trading on ad auction exchanges.The proposed research is to develop advanced algorithms that help improve the yield and maximize the profitability for algorithmic trading in the ad auction context. The key issues are bidding strategies that must operate at very fast time scales of around 100 milliseconds. The research will consist of three main components: 1) Development of models and techniques for ad space bidding given strict time constraints.2) Development of algorithmic trading strategies, and 3) Implementation of strategies. We will work closely with our industrial partner in the 2nd and 3rd thrusts.The research will involve many components: 1) Building models of random interactions using ideas from random exchange theory, 2) Understanding the role of budget and time constraints both in terms of execution time as well as campaign time horizon, 3) Understanding the role of information in the context of actions, 4) Develop techniques and algorithms for price discovery, and 5) Development of real-time bidding algorithms that can operate on the information history within the constraints of the auction durations.The techniques will involve Markov models, mean field theory, stochastic decision theory, learning, and the development of algorithms.