A HYBRID ALGORITHM FOR THE ADWORDS PROBLEM

DOI Web Site Web Site 参考文献9件

この論文をさがす

抄録

<p>The adwords problem (or the ad-auctions problem) is an online problem which decides allocations of advertisements to search words. The search words arrive one-by-one and a search engine decides what advertisement to display upon arrival of each search word. The owner of the search engine receives revenues from advertisers and the objective of the adwords problem is to maximize the sum of revenues. In this paper, we propose a hybrid algorithm for the adwords problem by combining two algorithms called a greedy algorithm and a PD algorithm. The proposed algorithm has a parameter k ∈ [0,1] and a competitive ratio of the algorithm is 1/(k (e/e-1) + 2 (1-k)) under the small bid assumption. We conduct preliminary numerical experiments, and we observe that the proposed algorithm outperforms other two algorithms with a suitable parameter k.</p>

収録刊行物

参考文献 (9)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ