A HYBRID ALGORITHM FOR THE ADWORDS PROBLEM
-
- Moriyama Iori
- Tokyo Institute of Technology
-
- Mizuno Shinji
- Tokyo Institute of Technology
Search this article
Abstract
<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>
Journal
-
- Journal of the Operations Research Society of Japan
-
Journal of the Operations Research Society of Japan 66 (3), 176-186, 2023-07-31
The Operations Research Society of Japan
- Tweet
Keywords
Details 詳細情報について
-
- CRID
- 1390296973275982976
-
- NII Book ID
- AA00703935
-
- ISSN
- 21888299
- 04534514
-
- NDL BIB ID
- 032962726
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- NDL
- Crossref
-
- Abstract License Flag
- Disallowed