Title :
A Primal Dual Approach for Dynamic Bid Optimization
Author :
Yu, Lingfei ; She, Kun ; Yu, Changyuan
Author_Institution :
Sch. of Comput. Sci. & Eng., Univ. of Electron. Sci. & Technol., Chengdu, China
Abstract :
We study the dynamic bid optimization problem via a primal dual approach. In the case we have no information about the distribution of queries, we reconstruct the ln(U/L) + 1 competitive algorithm proposed in [ZCL08] through a systematic way and showed the intuition behind this algorithm. In the case of random permutation model, we showed that the learning technique used in [DH09] can give us a (1 - O(ϵ)) competitive algorithm for any small constant ϵ >; 0 as long as the optimum is large enough.
Keywords :
approximation theory; computational complexity; optimisation; competitive algorithm; dynamic bid optimization; primal dual approach; query distribution; random permutation model; approximation algorithm; bid optimization; primal dual approach;
Conference_Titel :
Parallel and Distributed Systems (ICPADS), 2010 IEEE 16th International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-9727-0
Electronic_ISBN :
1521-9097
DOI :
10.1109/ICPADS.2010.75
