557 research outputs found

    Online Advertising Assignment Problems Considering Realistic Constraints

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ์‚ฐ์—…๊ณตํ•™๊ณผ, 2020. 8. ๋ฌธ์ผ๊ฒฝ.With a drastic increase in online communities, many companies have been paying attention to online advertising. The main advantages of online advertising are traceability, cost-effectiveness, reachability, and interactivity. The benefits facilitate the continuous popularity of online advertising. For Internet-based companies, a well-constructed online advertisement assignment increases their revenue. Hence, the managers need to develop their decision-making processes for assigning online advertisements on their website so that their revenue is maximized. In this dissertation, we consider online advertising assignment problems considering realistic constraints. There are three types of online advertising assignment problems: (i) Display ads problem in adversarial order, (ii) Display ads problem in probabilistic order, and (iii) Online banner advertisement scheduling for advertising effectiveness. Unlike previous assignment problems, the problems are pragmatic approaches that reflect realistic constraints and advertising effectiveness. Moreover, the algorithms the dissertation designs offer important insights into the online advertisement assignment problem. We give a brief explanation of the fundamental methodologies to solve the online advertising assignment problems in Chapter 1. At the end of this chapter, the contributions and outline of the dissertation are also presented. In Chapter 2, we propose the display ads problem in adversarial order. Deterministic algorithms with worst-case guarantees are designed, and the competitive ratios of them are presented. Upper bounds for the problem are also proved. We investigate the display ads problem in probabilistic order in Chapter 3. This chapter presents stochastic online algorithms with scenario-based stochastic programming and Benders decomposition for two probabilistic order models. In Chapter 4, an online banner advertisement scheduling model for advertising effectiveness is designed. We also present the solution methodologies used to obtain valid lower and upper bounds of the model efficiently. Chapter 5 offers conclusions and suggestion for future studies. The approaches to solving the problems are meaningful in both academic and industrial areas. We validate these approaches can solve the problems efficiently and effectively by conducting computational experiments. The models and solution methodologies are expected to be convenient and beneficial when managers at Internet-based companies place online advertisements on their websites.์˜จ๋ผ์ธ ์ปค๋ฎค๋‹ˆํ‹ฐ์˜ ๊ธ‰๊ฒฉํ•œ ์„ฑ์žฅ์— ๋”ฐ๋ผ, ๋งŽ์€ ํšŒ์‚ฌ๋“ค์ด ์˜จ๋ผ์ธ ๊ด‘๊ณ ์— ๊ด€์‹ฌ์„ ๊ธฐ์šธ์ด๊ณ  ์žˆ๋‹ค. ์˜จ๋ผ์ธ ๊ด‘๊ณ ์˜ ์žฅ์ ์œผ๋กœ๋Š” ์ถ”์  ๊ฐ€๋Šฅ์„ฑ, ๋น„์šฉ ํšจ๊ณผ์„ฑ, ๋„๋‹ฌ ๊ฐ€๋Šฅ์„ฑ, ์ƒํ˜ธ์ž‘์šฉ์„ฑ ๋“ฑ์ด ์žˆ๋‹ค. ์˜จ๋ผ์ธ์— ๊ธฐ๋ฐ˜์„ ๋‘๋Š” ํšŒ์‚ฌ๋“ค์€ ์ž˜ ์งœ์—ฌ์ง„ ์˜จ๋ผ์ธ ๊ด‘๊ณ  ํ• ๋‹น๊ฒฐ์ •์— ๊ด€์‹ฌ์„ ๋‘๊ณ  ์žˆ๊ณ , ์ด๋Š” ๊ด‘๊ณ  ์ˆ˜์ต๊ณผ ์—ฐ๊ด€๋  ์ˆ˜ ์žˆ๋‹ค. ๋”ฐ๋ผ์„œ ์˜จ๋ผ์ธ ๊ด‘๊ณ  ๊ด€๋ฆฌ์ž๋Š” ์ˆ˜์ต์„ ๊ทน๋Œ€ํ™” ํ•  ์ˆ˜ ์žˆ๋Š” ์˜จ๋ผ์ธ ๊ด‘๊ณ  ํ• ๋‹น ์˜์‚ฌ ๊ฒฐ์ • ํ”„๋กœ์„ธ์Šค๋ฅผ ๊ฐœ๋ฐœํ•˜์—ฌ์•ผ ํ•œ๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ๋Š” ํ˜„์‹ค์ ์ธ ์ œ์•ฝ์„ ๊ณ ๋ คํ•œ ์˜จ๋ผ์ธ ๊ด‘๊ณ  ํ• ๋‹น ๋ฌธ์ œ๋“ค์„ ์ œ์•ˆํ•œ๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ ๋‹ค๋ฃจ๋Š” ๋ฌธ์ œ๋Š” (1) adversarial ์ˆœ์„œ๋กœ ์ง„ํ–‰ํ•˜๋Š” ๋””์Šคํ”Œ๋ ˆ์ด ์• ๋“œ๋ฌธ์ œ, (2) probabilistic ์ˆœ์„œ๋กœ ์ง„ํ–‰ํ•˜๋Š” ๋””์Šคํ”Œ๋ ˆ์ด ์• ๋“œ๋ฌธ์ œ ๊ทธ๋ฆฌ๊ณ  (3) ๊ด‘๊ณ ํšจ๊ณผ๋ฅผ ์œ„ํ•œ ์˜จ๋ผ์ธ ๋ฐฐ๋„ˆ ๊ด‘๊ณ  ์ผ์ •๊ณ„ํš์ด๋‹ค. ์ด์ „์— ์ œ์•ˆ๋˜์—ˆ๋˜ ๊ด‘๊ณ  ํ• ๋‹น ๋ฌธ์ œ๋“ค๊ณผ ๋‹ฌ๋ฆฌ, ๋ณธ ๋…ผ๋ฌธ์—์„œ ์ œ์•ˆํ•œ ๋ฌธ์ œ๋“ค์€ ํ˜„์‹ค์ ์ธ ์ œ์•ฝ๊ณผ ๊ด‘๊ณ ํšจ๊ณผ๋ฅผ ๋ฐ˜์˜ํ•˜๋Š” ์‹ค์šฉ์ ์ธ ์ ‘๊ทผ ๋ฐฉ์‹์ด๋‹ค. ๋˜ํ•œ ์ œ์•ˆํ•˜๋Š” ์•Œ๊ณ ๋ฆฌ์ฆ˜์€ ์˜จ๋ผ์ธ ๊ด‘๊ณ  ํ• ๋‹น ๋ฌธ์ œ์˜ ์šด์˜๊ด€๋ฆฌ์— ๋Œ€ํ•œ ํ†ต์ฐฐ๋ ฅ์„ ์ œ๊ณตํ•œ๋‹ค. 1์žฅ์—์„œ๋Š” ์˜จ๋ผ์ธ ๊ด‘๊ณ  ํ• ๋‹น ๋ฌธ์ œ์— ๋Œ€ํ•œ ๋ฌธ์ œํ•ด๊ฒฐ ๋ฐฉ๋ฒ•๋ก ์— ๋Œ€ํ•ด ๊ฐ„๋‹จํžˆ ์†Œ๊ฐœํ•œ๋‹ค. ๋”๋ถˆ์–ด ์—ฐ๊ตฌ์˜ ๊ธฐ์—ฌ์™€ ๊ฐœ์š”๋„ ์ œ๊ณต๋œ๋‹ค. 2์žฅ์—์„œ๋Š” adversarial ์ˆœ์„œ๋กœ ์ง„ํ–‰ํ•˜๋Š” ๋””์Šคํ”Œ๋ ˆ์ด ์• ๋“œ๋ฌธ์ œ๋ฅผ ์ œ์•ˆํ•œ๋‹ค. worst-case๋ฅผ ๋ณด์žฅํ•˜๋Š” ๊ฒฐ์ •๋ก ์  ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์„ค๊ณ„ํ•˜๊ณ , ์ด๋“ค์˜ competitive ratio๋ฅผ ์ฆ๋ช…ํ•œ๋‹ค. ๋”๋ถˆ์–ด ๋ฌธ์ œ์˜ ์ƒํ•œ๋„ ์ž…์ฆ๋œ๋‹ค. 3์žฅ์—์„œ๋Š” probabilistic ์ˆœ์„œ๋กœ ์ง„ํ–‰ํ•˜๋Š” ๋””์Šคํ”Œ๋ ˆ์ด ์• ๋“œ๋ฌธ์ œ๋ฅผ ์ œ์•ˆํ•œ๋‹ค. ์‹œ๋‚˜๋ฆฌ์˜ค ๊ธฐ๋ฐ˜์˜ ํ™•๋ฅ ๋ก ์  ์˜จ๋ผ์ธ ์•Œ๊ณ ๋ฆฌ์ฆ˜๊ณผ Benders ๋ถ„ํ•ด๋ฐฉ๋ฒ•์„ ํ˜ผํ•ฉํ•œ ์ถ”๊ณ„ ์˜จ๋ผ์ธ ์•Œ๊ณ ๋ฆฌ์ฆ˜์„ ์ œ์‹œํ•œ๋‹ค. 4์žฅ์—์„œ๋Š” ๊ด‘๊ณ ํšจ๊ณผ๋ฅผ ์œ„ํ•œ ์˜จ๋ผ์ธ ๋ฐฐ๋„ˆ ๊ด‘๊ณ  ์ผ์ •๊ณ„ํš์„ ์„ค๊ณ„ํ•œ๋‹ค. ๋˜ํ•œ, ๋ชจ๋ธ์˜ ์œ ํšจํ•œ ์ƒํ•œ๊ณผ ํ•˜ํ•œ์„ ํšจ์œจ์ ์œผ๋กœ ์–ป๋Š” ๋ฐ ์‚ฌ์šฉ๋˜๋Š” ๋ฌธ์ œํ•ด๊ฒฐ ๋ฐฉ๋ฒ•๋ก ์„ ์ œ์•ˆํ•œ๋‹ค. 5์žฅ์—์„œ๋Š” ๋ณธ ๋…ผ๋ฌธ์˜ ๊ฒฐ๋ก ๊ณผ ํ–ฅํ›„ ์—ฐ๊ตฌ๋ฅผ ์œ„ํ•œ ๋ฐฉํ–ฅ์„ ์ œ๊ณตํ•œ๋‹ค. ๋ณธ ๋…ผ๋ฌธ์—์„œ ์ œ์•ˆํ•˜๋Š” ๋ฌธ์ œํ•ด๊ฒฐ ๋ฐฉ๋ฒ•๋ก ์€ ํ•™์ˆ  ๋ฐ ์‚ฐ์—… ๋ถ„์•ผ ๋ชจ๋‘ ์˜๋ฏธ๊ฐ€ ์žˆ๋‹ค. ์ˆ˜์น˜ ์‹คํ—˜์„ ํ†ตํ•ด ๋ฌธ์ œํ•ด๊ฒฐ ์ ‘๊ทผ ๋ฐฉ์‹์ด ๋ฌธ์ œ๋ฅผ ํšจ์œจ์ ์ด๊ณ  ํšจ๊ณผ์ ์œผ๋กœ ํ•ด๊ฒฐํ•  ์ˆ˜ ์žˆ์Œ์„ ๋ณด์ธ๋‹ค. ์ด๋Š” ์˜จ๋ผ์ธ ๊ด‘๊ณ  ๊ด€๋ฆฌ์ž๊ฐ€ ๋ณธ ๋…ผ๋ฌธ์—์„œ ์ œ์•ˆํ•˜๋Š” ๋ฌธ์ œ์™€ ๋ฌธ์ œํ•ด๊ฒฐ ๋ฐฉ๋ฒ•๋ก ์„ ํ†ตํ•ด ์˜จ๋ผ์ธ ๊ด‘๊ณ  ํ• ๋‹น๊ด€๋ จ ์˜์‚ฌ๊ฒฐ์ •์„ ์ง„ํ–‰ํ•˜๋Š” ๋ฐ ์žˆ์–ด ๋„์›€์ด ๋  ๊ฒƒ์œผ๋กœ ๊ธฐ๋Œ€ํ•œ๋‹ค.Chapter 1 Introduction 1 1.1 Display Ads Problem 3 1.1.1 Online Algorithm 4 1.2 Online Banner Advertisement Scheduling Problem 5 1.3 Research Motivations and Contributions 6 1.4 Outline of the Dissertation 9 Chapter 2 Online Advertising Assignment Problem in Adversarial Order 12 2.1 Problem Description and Literature Review 12 2.2 Display Ads Problem in Adversarial Order 15 2.3 Deterministic Algorithms for Adversarial Order 17 2.4 Upper Bounds of Deterministic Algorithms for Adversarial Order 22 2.5 Summary 28 Chapter 3 Online Advertising Assignment Problem in Probabilistic Order 30 3.1 Problem Description and Literature Review 30 3.2 Display Ads Problem in Probabilistic Order 33 3.3 Stochastic Online Algorithms for Probabilistic Order 34 3.3.1 Two-Stage Stochastic Programming 35 3.3.2 Known IID model 37 3.3.3 Random permutation model 41 3.3.4 Stochastic approach using primal-dual algorithm 45 3.4 Computational Experiments 48 3.4.1 Results for known IID model 55 3.4.2 Results for random permutation model 57 3.4.3 Managerial insights for Algorithm 3.1 59 3.5 Summary 60 Chapter 4 Online Banner Advertisement Scheduling for Advertising Effectiveness 61 4.1 Problem Description and Literature Review 61 4.2 Mathematical Model 68 4.2.1 Objective function 68 4.2.2 Notations and formulation 72 4.3 Solution Methodologies 74 4.3.1 Heuristic approach to finding valid lower and upper bounds 75 4.3.2 Hybrid tabu search 79 4.4 Computational Experiments 80 4.4.1 Results for problems with small data sets 82 4.4.2 Results for problems with large data sets 84 4.4.3 Results for problems with standard data 86 4.4.4 Managerial insights for the results 90 4.5 Summary 92 Chapter 5 Conclusions and Future Research 93 Appendices 97 A Initial Sequence of the Hybrid Tabu Search 98 B Procedure of the Hybrid Tabu Search 99 C Small Example of the Hybrid Tabu Search 101 D Linearization Technique of Bilinear Form in R2 104 Bibliography 106Docto

    ๋ชจ๋ฐ”์ผ ๋งค์ฒด์˜ ์ˆ˜์ต ์ตœ์ ํ™”๋ฅผ ์œ„ํ•œ ๋””์Šคํ”Œ๋ ˆ์ด ๊ด‘๊ณ  ์š”์†Œ ๋ฐ ์›Œํ„ฐํด ์ž…์ฐฐ ์ „๋žต ํ‰๊ฐ€

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ํ˜‘๋™๊ณผ์ • ๊ธฐ์ˆ ๊ฒฝ์˜ยท๊ฒฝ์ œยท์ •์ฑ…์ „๊ณต, 2020. 8. ์œค๋ช…ํ™˜.Advertising revenue has become an important revenue source for mobile publishers, along with in-app purchase. Based on empirical data and academic methodology, this study attempted to solve two key problems that mobile publishers face when trying to maximize advertising revenue. This study analyzed transaction history data of mobile advertising from AD(x) Inc., a company that provides services to optimize ad revenue for mobile publishers by operating multiple ad networks simultaneously, including Google AdMob and Facebook Audience Network. The first problem mobile publishers face when trying to gain revenue through advertising is determining the optimal ad position and ad format for the service UX of mobile publishers. To provide guidelines for the first decision, this study analyzed characteristics of mobile advertising, including native ads and rewarded video ads, which have been relatively recently introduced. As a result, in addition to various ad factors defined by previous research through traditional advertising media, three new ad factors were summarized: ad density, disclosure position, and disclosure method. Moreover, the relationships among the three new derived ad factors, ad revenue, and ad effectiveness were analyzed. First, in relation to ad density, which is the proportion of an advertisements physical area relative to the full-screen area, the higher the ad density, the higher both the ad revenue and advertising effectiveness. On the other hand, among advertisements with similar ad density, there was a difference in ad revenue and advertising effectiveness according to ad format. Among advertisements with low ad density, native banner ads showed higher ad revenue and advertising effectiveness than banner ads. Among advertisements with high ad density, rewarded video ads showed the highest ad revenue, and interstitial ads showed the highest advertising effectiveness. As for the second new ad factor, disclosure position, the effectiveness of advertisements displayed at the top of the screen was higher in the PC web environment, but advertisements displayed at the bottom of the screen in the mobile environment were higher in terms of ad revenue and advertising effectiveness. Lastly, in the analysis of the third new ad factor, disclosure method, advertisements with the same ad format as native ads were classified in three categories, based on their development by mobile publishers: Separated area, List UI, and Pop-up. This study analyzed the relationship between disclosure method, ad revenue, and advertising effectiveness. The results showed that the highest ad revenue and advertising effectiveness were found in the Pop-up disclosure method. The second problem that mobile publishers face after determining ad position and ad format is the optimization of waterfall settings such as the priority and reserve prices of each ad network to maximize ad revenue when mobile advertising is served from multiple ad networks. On the other hand, between ad networks and mobile publishers, there is information asymmetry. Hence, ad networks have more information, so this study proposed a reserve price strategy for the operation of waterfall bidding among multiple ad networks to maximize ad revenue, even under information asymmetry. First, a demand curve-based model was designed to explain the loss of ad revenue when a mobile publisher sells its ad inventory at a non-optimized price using waterfall bidding. In addition, sensitivity analysis was conducted to show that the proposed model performs better than the companys existing bidding strategy. Moreover, this model enabled mobile publishers to have better performance with independent correlation, not a positive correlation of ad networks bid prices. Therefore, mobile publishers can use the key finding that the proposed model is more effective in reducing expected advertising losses under information asymmetry. In addition, it was found that performance improved to a greater extent when ad networks have less bid price similarity. This study provides guidelines that can be utilized not only in an academic sense but also in a real business environment. Standardized knowledge for small- and medium-sized mobile publishers, in particular, which have a relatively high ad network dependency, is suggested to improve their understanding of ad network usage and to establish optimized advertising operation policies.๊ด‘๊ณ  ์ˆ˜์ต์€ ๋ชจ๋ฐ”์ผ ๋งค์ฒด์—๊ฒŒ ์žˆ์–ด์„œ, ์ธ์•ฑ ํŒ๋งค (in-app purchase) ์™€ ํ•จ๊ป˜ ์ค‘์š”ํ•œ ์ˆ˜์ต์› ์ค‘ ํ•˜๋‚˜๊ฐ€ ๋˜์—ˆ๋‹ค. ๋ณธ ์—ฐ๊ตฌ์—์„œ๋Š” ๋ชจ๋ฐ”์ผ ๋งค์ฒด๊ฐ€ ๊ด‘๊ณ  ์ˆ˜์ต์„ ์ตœ๋Œ€ํ™”ํ•˜๊ณ ์ž ํ•  ๋•Œ ๋งˆ์ฃผํ•˜๊ฒŒ ๋˜๋Š” ๋‘ ๊ฐ€์ง€ ํ•ต์‹ฌ ๊ณผ์ œ๋ฅผ ์‹ค์ฆ์ ์ธ ๋ฐ์ดํ„ฐ์™€ ํ•™์ˆ ์ ์ธ ๋ฐฉ๋ฒ•๋ก ์„ ํ†ตํ•ด ํ•ด๊ฒฐํ•˜๊ณ ์ž ํ•˜์˜€๋‹ค. ๋ณธ ์—ฐ๊ตฌ๋Š”, Google AdMob, Facebook Audience Network ๋ฅผ ํฌํ•จํ•˜๋Š” ๋‹ค์ˆ˜์˜ ๊ด‘๊ณ  ๋„คํŠธ์›Œํฌ๋ฅผ ๋™์‹œ์— ์šด์˜ํ•˜์—ฌ ๋ชจ๋ฐ”์ผ ๋งค์ฒด์˜ ๊ด‘๊ณ  ์ˆ˜์ต์„ ์ตœ์ ํ™”ํ•˜๋Š” ์„œ๋น„์Šค๋ฅผ ์ œ๊ณตํ•˜๊ณ  ์žˆ๋Š” ๊ธฐ์—…, ์ฃผ์‹ํšŒ์‚ฌ ์• ๋“œ์—‘์Šค์˜ 2019๋…„ ๊ด‘๊ณ  ๊ฒฐ๊ณผ ํ†ต๊ณ„ ๋ฐ์ดํ„ฐ์—์„œ ์ถ”์ถœํ•˜์—ฌ ๋ถ„์„๊ณผ ํ‰๊ฐ€๋ฅผ ์ง„ํ–‰ํ•˜์˜€๋‹ค. ๋ชจ๋ฐ”์ผ ๋งค์ฒด๊ฐ€ ๊ด‘๊ณ ๋ฅผ ํ†ตํ•ด ์ˆ˜์ต์„ ์–ป๊ณ ์ž ํ•  ๋•Œ ๊ฐ€์žฅ ์ฒ˜์Œ์œผ๋กœ ๋งˆ์ฃผํ•˜๋Š” ๊ณผ์ œ๋Š”, ๋ชจ๋ฐ”์ผ ๋งค์ฒด์˜ ์„œ๋น„์Šค UX์— ์ตœ์ ํ™”๋œ ๊ด‘๊ณ  ์œ„์น˜์™€ ๊ด‘๊ณ  ํฌ๋งท์„ ๊ฒฐ์ •ํ•˜๋Š” ๊ฒƒ์ด๋‹ค. ์ด ๊ฒฐ์ •์— ๊ฐ€์ด๋“œ๋ผ์ธ์„ ์ œ๊ณตํ•˜๊ธฐ ์œ„ํ•ด, ์ƒ๋Œ€์ ์œผ๋กœ ์ตœ๊ทผ ๋„์ž…๋œ ๋„ค์ดํ‹ฐ๋ธŒ ๊ด‘๊ณ , ๋ฆฌ์›Œ๋“œ ๋น„๋””์˜ค ๊ด‘๊ณ ๋ฅผ ํฌํ•จํ•œ ๋ชจ๋ฐ”์ผ ๊ด‘๊ณ ๊ฐ€ ๊ฐ€์ง€๋Š” ํŠน์ง•์„ ๋ถ„์„ํ•˜์˜€๋‹ค. ๊ทธ ๊ฒฐ๊ณผ, ์ „ํ†ต์ ์ธ ๊ด‘๊ณ  ๋งค์ฒด์— ๋…ธ์ถœ๋˜๋Š” ๊ด‘๊ณ ๋ฅผ ํ†ตํ•ด ์ •์˜๋œ ๋‹ค์–‘ํ•œ ๊ด‘๊ณ  ์š”์†Œ ์™ธ์—, ์„ธ ๊ฐ€์ง€ ์‹ ๊ทœ ๊ด‘๊ณ  ์š”์†Œ; ๊ด‘๊ณ  ๋ฐ€๋„, ๋…ธ์ถœ ์œ„์น˜, ๋…ธ์ถœ ๋ฐฉ๋ฒ•์„ ์ •๋ฆฌํ•˜์˜€์œผ๋ฉฐ, ๋„์ถœ๋œ ์‹ ๊ทœ ๊ด‘๊ณ  ์š”์†Œ์™€ ๊ด‘๊ณ  ์ˆ˜์ต, ๊ด‘๊ณ  ํšจ๊ณผ ๊ฐ„์˜ ๊ด€๊ณ„๋ฅผ ๋ถ„์„ํ•˜์˜€๋‹ค. ๋จผ์ €, ์„œ๋น„์Šค ํ™”๋ฉด ๋‚ด์— ๊ด‘๊ณ ๊ฐ€ ์ฐจ์ง€ํ•˜๋Š” ๋น„์œจ์ธ ๊ด‘๊ณ  ๋ฐ€๋„์™€ ๊ด€๋ จํ•˜์—ฌ, ๊ด‘๊ณ  ๋ฐ€๋„๊ฐ€ ๋†’์„์ˆ˜๋ก ๊ด‘๊ณ  ์ˆ˜์ต๊ณผ ๊ด‘๊ณ  ํšจ๊ณผ, ๋ชจ๋‘ ๋†’์€ ๊ฒฐ๊ณผ๋ฅผ ์–ป์—ˆ๋‹ค. ํ•œํŽธ, ์œ ์‚ฌํ•œ ๊ด‘๊ณ  ๋ฐ€๋„๋ฅผ ๊ฐ€์ง„ ๊ด‘๊ณ  ๊ฐ„์—๋„ ๊ด‘๊ณ  ํฌ๋งท์— ๋”ฐ๋ผ ๊ด‘๊ณ  ์ˆ˜์ต, ๊ด‘๊ณ  ํšจ๊ณผ๊ฐ€ ์ฐจ์ด๋ฅผ ๋ณด์˜€๋‹ค. ๋‚ฎ์€ ๊ด‘๊ณ  ๋ฐ€๋„๋ฅผ ๊ฐ€์ง„ ๊ด‘๊ณ  ์ค‘์—์„œ๋Š” ๋„ค์ดํ‹ฐ๋ธŒ ๋ฐฐ๋„ˆ ๊ด‘๊ณ ๊ฐ€ ๋ฐฐ๋„ˆ ๊ด‘๊ณ  ๋ณด๋‹ค ๋” ๋†’์€ ๊ด‘๊ณ  ์ˆ˜์ต๊ณผ ๊ด‘๊ณ  ํšจ๊ณผ๋ฅผ ๋ณด์˜€์œผ๋ฉฐ, ๋†’์€ ๊ด‘๊ณ  ๋ฐ€๋„๋ฅผ ๊ฐ€์ง„ ๊ด‘๊ณ  ์ค‘์—์„œ๋Š” ๋ฆฌ์›Œ๋“œ ๋น„๋””์˜ค ๊ด‘๊ณ ๊ฐ€ ๊ฐ€์žฅ ๋†’์€ ๊ด‘๊ณ  ์ˆ˜์ต์„ ๋‚˜ํƒ€๋ƒˆ๊ณ , ์ „๋ฉด ๊ด‘๊ณ ๊ฐ€ ๊ฐ€์žฅ ๋†’์€ ๊ด‘๊ณ  ํšจ๊ณผ๋ฅผ ๋ณด์˜€๋‹ค. ๋‘๋ฒˆ์งธ ์‹ ๊ทœ ๊ด‘๊ณ  ์š”์†Œ์ธ ๋…ธ์ถœ ์œ„์น˜์™€ ๊ด€๋ จํ•˜์—ฌ, ๊ธฐ์กด PC ๋˜๋Š” ์›น ํ™˜๊ฒฝ์—์„œ๋Š” ํ™”๋ฉด ์ƒ๋‹จ์— ๋…ธ์ถœ๋œ ๊ด‘๊ณ ์˜ ๊ด‘๊ณ  ํšจ๊ณผ๊ฐ€ ๊ฐ€์žฅ ๋†’์•˜์œผ๋‚˜, ๋ชจ๋ฐ”์ผ ํ™˜๊ฒฝ์—์„œ๋Š” ํ™”๋ฉด ์•„๋ž˜์— ๋…ธ์ถœ๋œ ๊ด‘๊ณ ๊ฐ€ ๊ด‘๊ณ  ์ˆ˜์ต, ๊ด‘๊ณ  ํšจ๊ณผ, ๋ชจ๋‘ ๋” ๋†’๊ฒŒ ๋‚˜ํƒ€๋‚ฌ๋‹ค. ๋งˆ์ง€๋ง‰์œผ๋กœ, ๋…ธ์ถœ ๋ฐฉ๋ฒ• ์™€ ๊ด€๋ จํ•œ ๋ถ„์„์—์„œ๋Š”, ๋™์ผํ•œ ๋„ค์ดํ‹ฐ๋ธŒ ๊ด‘๊ณ  ํฌ๋งท์ด์ง€๋งŒ, ๋ชจ๋ฐ”์ผ ๋งค์ฒด์— ์˜ํ•ด ๊ฐœ๋ฐœ๋œ ๋…ธ์ถœ ๋ฐฉ๋ฒ•์— ๋”ฐ๋ผ, ๋ถ„๋ฆฌ๋œ ์˜์—ญ, ๋ฆฌ์ŠคํŠธ UI, Pop-up ๋กœ ๊ตฌ๋ถ„ํ•˜์˜€๊ณ , ๋‹ค์–‘ํ•œ ๋…ธ์ถœ ๋ฐฉ๋ฒ•์— ๋”ฐ๋ฅธ ๊ด‘๊ณ  ์ˆ˜์ต, ๊ด‘๊ณ  ํšจ๊ณผ๋ฅผ ๋น„๊ต ๋ถ„์„ํ•ด๋ณด์•˜๋‹ค. ๊ทธ ๊ฒฐ๊ณผ Pop-up ํ˜•ํƒœ์˜ ๋…ธ์ถœ ๋ฐฉ๋ฒ•์—์„œ ๊ฐ€์žฅ ๋†’์€ ๊ด‘๊ณ  ์ˆ˜์ต๊ณผ ๊ด‘๊ณ  ํšจ๊ณผ๊ฐ€ ๋‚˜ํƒ€๋‚ฌ๋‹ค. ๋ชจ๋ฐ”์ผ ๋งค์ฒด๊ฐ€ ๊ด‘๊ณ  ์œ„์น˜์™€ ๊ด‘๊ณ  ํฌ๋งท์„ ๊ฒฐ์ •ํ•œ ๋’ค์— ์ง๋ฉดํ•˜๋Š” ๋‘๋ฒˆ์งธ ํ•ต์‹ฌ ๊ณผ์ œ๋Š”, ๋‹ค์ˆ˜์˜ ๊ด‘๊ณ  ๋„คํŠธ์›Œํฌ๋กœ๋ถ€ํ„ฐ ๊ด‘๊ณ ๋ฅผ ์ œ๊ณต๋ฐ›์•„ ๋…ธ์ถœํ•  ๋•Œ, ๊ด‘๊ณ  ์ˆ˜์ต์ด ์ตœ๋Œ€ํ™” ๋  ์ˆ˜ ์žˆ๋„๋ก ๊ฐ ๊ด‘๊ณ  ๋„คํŠธ์›Œํฌ์˜ ์šฐ์„ ์ˆœ์œ„, ์˜ˆ์•ฝ ๊ฐ€๊ฒฉ (reserve price) ๋“ฑ ์›Œํ„ฐํด ์„ธํŒ…์„ ์ตœ์ ํ™” ํ•˜๋Š” ๊ฒƒ์ด๋‹ค. ํ•œํŽธ, ๊ด‘๊ณ  ๋„คํŠธ์›Œํฌ์™€ ๋ชจ๋ฐ”์ผ ๋งค์ฒด ์‚ฌ์ด์—๋Š” ๊ด‘๊ณ  ๋„คํŠธ์›Œํฌ๊ฐ€ ๋” ๋งŽ์€ ์ •๋ณด๋ฅผ ๊ฐ€์ง€๊ณ  ์žˆ๋Š” ์ •๋ณด ๋น„๋Œ€์นญ์ด ์กด์žฌํ•˜๋Š”๋ฐ, ๋ณธ ์—ฐ๊ตฌ๋Š” ์ด๋Ÿฐ ์ •๋ณด ๋น„๋Œ€์นญ ํ•˜์—์„œ ๊ด‘๊ณ  ์ˆ˜์ต์„ ์ตœ๋Œ€ํ™” ์œ„ํ•˜์—ฌ, ์ตœ์ € ๊ฐ€๊ฒฉ (reserve price) ์ „๋žต์„ ํ†ตํ•œ ์›Œํ„ฐํด ์„ธํŒ… ๋ฐฉ๋ฒ•์„ ์ œ์•ˆํ•˜์˜€๋‹ค. ๋จผ์ €, ๋ชจ๋ฐ”์ผ ๋งค์ฒด์˜ ๊ด‘๊ณ  ํŒ๋งค ๊ฐ€๊ฒฉ์ด ์ตœ์ ํ™” ๋˜์–ด ์žˆ๋Š”์ง€๋ฅผ ์„ค๋ช…ํ•˜๊ธฐ ์œ„ํ•˜์—ฌ ์ˆ˜์š” ๊ณก์„  ๊ธฐ๋ฐ˜ ๋ชจ๋ธ์„ ์„ค๊ณ„ํ•˜์˜€๋‹ค. ๊ทธ๋ฆฌ๊ณ , ๋ฏผ๊ฐ๋„ ๋ถ„์„์„ ํ†ตํ•ด ์ œ์•ˆ๋œ ๋ชจ๋ธ์ด ๊ธฐ์กด ์šด์˜ ์ „๋žต๋ณด๋‹ค ์šฐ์ˆ˜ํ•จ์„ ๋น„๊ตํ•ด ๋ณด์˜€๋‹ค. ๋˜ํ•œ, ์ œ์•ˆ๋œ ๋ชจ๋ธ์„ ํ†ตํ•ด, ๊ด‘๊ณ  ๋„คํŠธ์›Œํฌ ๊ฐ„์˜ ์ž…์ฐฐ ๊ฐ€๊ฒฉ์ด ์ƒ๊ด€ ๊ด€๊ณ„๊ฐ€ ์žˆ์„ ๋•Œ๋ณด๋‹ค ๋…๋ฆฝ์ ์ผ ๋•Œ ๋” ๋†’์€ ๊ด‘๊ณ  ์ˆ˜์ต์„ ์–ป์„ ์ˆ˜ ์žˆ์Œ์„ ๋ฐํ˜”๋‹ค. ๋ณธ ์—ฐ๊ตฌ๋ฅผ ํ†ตํ•ด, ํ•™์ˆ ์ ์ธ ์˜๋ฏธ ๋ฟ๋งŒ ์•„๋‹ˆ๋ผ, ์‹ค์ œ ๊ฒฝ์˜ ํ™˜๊ฒฝ์—์„œ ๋ชจ๋ฐ”์ผ ๋งค์ฒด๊ฐ€ ๊ด‘๊ณ  ์ˆ˜์ต์„ ์ฐฝ์ถœํ•˜๊ณ  ๊ทน๋Œ€ํ™”ํ•˜๊ธฐ ์œ„ํ•ด์„œ ํ™œ์šฉํ•  ์ˆ˜ ์žˆ๋Š” ๊ฐ€์ด๋“œ๋ผ์ธ์„ ์ œ๊ณตํ•˜์˜€๋‹ค. ํŠนํžˆ ๊ด‘๊ณ  ๋„คํŠธ์›Œํฌ์— ๋Œ€ํ•œ ์˜์กด๋„๊ฐ€ ๋†’๊ณ , ๋‚ด๋ถ€ ์ž์›์˜ ์ œ์•ฝ์ด ์žˆ๋Š” ์ค‘์†Œ ๊ฐœ๋ฐœ์ž๋“ค์—๊ฒŒ ๋ณ„๋„์˜ R&D ์—†์ด ์ตœ์ ํ™”๋œ ๊ด‘๊ณ  ์šด์˜ ์ •์ฑ…์„ ์ˆ˜๋ฆฝํ•  ์ˆ˜ ์žˆ๋Š” ๋ฐฉ๋ฒ•์„ ์ œ์‹œํ•˜์˜€๋‹ค.Chapter 1. Introduction 1 Chapter 2. Literature Review 11 2.1 Real-Time Bidding 11 2.2 Ad Format 15 2.2.1 Native Ads 15 2.2.2 Rewarded Video Ads 17 2.3 Advertisement Performance Index 19 Chapter 3. Evaluation of Ad Factor 23 3.1 Introduction 23 3.1.1 Advertisement Factors 26 3.1.2 Environmental Factors 29 3.1.3 Audience Factors 32 3.2 Hypotheses and Dataset 34 3.2.1 Advertisement Density 34 3.2.2 Ad Format with the Same Advertisement Density 35 3.2.3 Disclosure Position with the Same Advertisement Density 36 3.2.4 Disclosure Method of Native Ads 37 3.2.5 Dataset 38 3.3 Results 41 3.3.1 Influence of Advertisement Density on Advertising Revenue and effectiveness 41 3.3.2 Heterogenous Influence with the Same Advertisement Density 43 3.3.3 Heterogenous Influence of Disclosure Position 46 3.3.4 Heterogeneous effect by Disclosure Method 47 3.4 Discussion 49 Chapter 4. Waterfall Strategy Development 57 4.1 Introduction 57 4.1.1 Information Asymmetry 60 4.1.2 Bidding Strategy 61 4.1.3 Price and Demand 63 4.2 Estimation of Ad Networks Demand Curves 65 4.2.1 Dataset 65 4.2.2 Demand Curve Estimation 67 4.3 Waterfall Bidding Strategy 76 4.4 Sensitivity Analysis 82 Chapter 5. Conclusion 91 5.1 Summary of Research Findings 91 5.2 Contribution of this Study 94 5.3 Limitation and Further Studies 96 Bibliography 97 Appendix 109 Abstract (Korean) 121Docto

    On the theory of truthful and fair pricing for banner advertisements

    Get PDF
    We consider revenue maximization problem in banner advertisements under two fundamental concepts: Envy-freeness and truthfulness. Envy-freeness captures fairness requirement among buyers while truthfulness gives buyers the incentive to announce truthful private bids. A extension of envy-freeness named competitive equilibrium, which requires both envy-freeness and market clearance conditions, is also investigated. For truthfulness also called incentive compatible, we adapt Bayesian settings, where each buyer's private value is drawn independently from publicly known distributions. Therefore, the truthfulness we adopt is Bayesian incentive compatible mechanisms. Most of our results are positive. We study various settings of revenue maximizing problem e.g. competitive equilibrium and envy-free solution in relaxed demand, sharp demand and consecutive demand case; Bayesian incentive compatible mechanism in relaxed demand, sharp demand, budget constraints and consecutive demand cases. Our approach allows us to argue that these simple mechanisms give optimal or approximate-optimal revenue guarantee in a very robust manner

    Market-based Recommendation: Agents that Compete for Consumer Attention

    No full text
    The amount of attention space available for recommending suppliers to consumers on e-commerce sites is typically limited. We present a competitive distributed recommendation mechanism based on adaptive software agents for efficiently allocating the 'consumer attention space', or banners. In the example of an electronic shopping mall, the task is delegated to the individual shops, each of which evaluates the information that is available about the consumer and his or her interests (e.g. keywords, product queries, and available parts of a profile). Shops make a monetary bid in an auction where a limited amount of 'consumer attention space' for the arriving consumer is sold. Each shop is represented by a software agent that bids for each consumer. This allows shops to rapidly adapt their bidding strategy to focus on consumers interested in their offerings. For various basic and simple models for on-line consumers, shops, and profiles, we demonstrate the feasibility of our system by evolutionary simulations as in the field of agent-based computational economics (ACE). We also develop adaptive software agents that learn bidding strategies, based on neural networks and strategy exploration heuristics. Furthermore, we address the commercial and technological advantages of this distributed market-based approach. The mechanism we describe is not limited to the example of the electronic shopping mall, but can easily be extended to other domains
    • โ€ฆ
    corecore