Filters








3,392 Hits in 5.1 sec

A Truthful Mechanism for Offline Ad Slot Scheduling [chapter]

Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pál
2008 Lecture Notes in Computer Science  
We consider the Offline Ad Slot Scheduling problem, where advertisers must be scheduled to sponsored search slots during a given period of time.  ...  Advertisers specify a budget constraint, as well as a maximum cost per click, and may not be assigned to more than one slot for a particular search. Lemma 4.  ...  To prove our result on the equilibrium of the revenue-maximizing mechanism, we first show that a greedy algorithm suffices to solve the revenue-maximizing linear program; we then use this insight to prove  ... 
doi:10.1007/978-3-540-79309-0_17 fatcat:24t3vedbirfzpgbwsircanlmoe

Optimizing direct response in Internet display advertising

Vural Aksakallı
2012 Electronic Commerce Research and Applications  
In such campaigns, advertisers reach out to a target audience via some form of a visual advertisement (hereinafter also called "ad") to maximize short-term sales revenue.  ...  In this study, we formulate an advertiser's revenue maximization problem in direct response Internet display advertisement campaigns as a mixed integer program via piecewise linear approximation of the  ...  It is important to distinguish this problem from that of Web publishers whose goal is to schedule and place ads from multiple advertisers to maximize their revenues.  ... 
doi:10.1016/j.elerap.2011.11.002 fatcat:jtkxfgv6vzcvnpfmjz7e7zziaq

A Truthful Mechanism for Offline Ad Slot Scheduling [article]

Jon Feldman, S. Muthukrishnan, Evdokia Nikolova, Martin Pal
2008 arXiv   pre-print
To prove our result on the equilibrium of the revenue-maximizing mechanism, we first show that a greedy algorithm suffices to solve the revenue-maximizing linear program; we then use this insight to prove  ...  We consider the "Offline Ad Slot Scheduling" problem, where advertisers must be scheduled to "sponsored search" slots during a given period of time.  ...  To prove our result on the equilibrium of the revenue-maximizing mechanism, we first show that a greedy algorithm suffices to solve the revenue-maximizing linear program; we then use this insight to prove  ... 
arXiv:0801.2931v1 fatcat:ytvryf27brbonmg4cx265yln44

Online repeated posted price auctions with a demand side platform [article]

Rahul Meshram, Kesav Kaza
2019 arXiv   pre-print
We formulate a revenue optimization problem at the intermediary and also consider the problem of scheduling advertisers with budget and impression constraints.  ...  We also investigate system from intermediary's perspective and devise algorithms for scheduling advertisers. Often the advertisers have budget constraints and impression constraints.  ...  We provide optimization formulation as revenue maximization and scheduling scheme for the advertisers at the DSP under impression constraints and budget constraints.  ... 
arXiv:1910.01860v1 fatcat:pzl2qpfbm5aztjf2zb5ckkrfea

Neural Auction: End-to-End Learning of Auction Mechanisms for E-Commerce Advertising [article]

Xiangyu Liu, Chuan Yu, Zhilin Zhang, Zhenzhe Zheng, Yu Rong, Hongtao Lv, Da Huo, Yiqing Wang, Dagui Chen, Jian Xu, Fan Wu, Guihai Chen (+1 others)
2021 arXiv   pre-print
In e-commerce advertising, it is crucial to jointly consider various performance metrics, e.g., user experience, advertiser utility, and platform revenue.  ...  Traditional auction mechanisms, such as GSP and VCG auctions, can be suboptimal due to their fixed allocation rules to optimize a single performance metric (e.g., revenue or social welfare).  ...  The authors would like to thank Rui Du, Haiping Huang, Haiyang He and Guan Wang who did the really hard work for online system implementation.  ... 
arXiv:2106.03593v2 fatcat:7o6z4bq2gbh3fcan2nusgcnmae

Revenue Maximization Approaches in IaaS Clouds: Research Challenges and Opportunities [article]

Afzal Badshah, Anwar Ghani, Ali Daud, Anthony Theodore Chronopoulos, Ateeqa Jalal
2020 arXiv   pre-print
, and advertising and auction.  ...  In this article, the main revenue factors are categorized as SLA and penalty management, resource scalability, customer satisfaction and management, resource utilization and provision, cost and price management  ...  and to sell under utilized resources it is better to do advertisement and auction.  ... 
arXiv:2004.11707v1 fatcat:n7lh2ftkxnfy7f6ymjbzsyexpi

Online Pricing for Revenue Maximization with Unknown Time Discounting Valuations

Weichao Mao, Zhenzhe Zheng, Fan Wu, Guihai Chen
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
In this paper, we study the problem of revenue maximization in online auctions with unknown time discounting valuations, and model it as non-stationary multi-armed bandit optimization.  ...  Online pricing mechanisms have been widely applied to resource allocation in multi-agent systems.  ...  Online Pricing Mechanism Design In this section, we present the pricing mechanism to maximize revenue in online auction with time discounting valuations.  ... 
doi:10.24963/ijcai.2018/61 dblp:conf/ijcai/MaoZWC18 fatcat:t2du626dlfhjtey7morakweiqq

Improving the Effectiveness of Time-Based Display Advertising

Daniel G. Goldstein, R. Preston McAfee, Siddharth Suri
2015 ACM Transactions on Economics and Computation  
We provide evidence that ads can be scheduled in a way that leads to greater total recollection, which advertisers value, and increased revenue, which publishers value. We document two main findings.  ...  We conclude with a theoretical prediction regarding the circumstances under which the display advertising industry would benefit if it moved to a partially or fully time-based standard.  ...  Note, then that utility maximization implies a price of ν (s * EX), yielding a revenue of ν (s * EX)s * EX.  ... 
doi:10.1145/2716323 fatcat:obo2blt6uvcwvobfoqnxtxsccu

Improving the effectiveness of time-based display advertising

Daniel G. Goldstein, Randolph Preston McAfee, Siddharth Suri
2012 Proceedings of the 13th ACM Conference on Electronic Commerce - EC '12  
We provide evidence that ads can be scheduled in a way that leads to greater total recollection, which advertisers value, and increased revenue, which publishers value. We document two main findings.  ...  We conclude with a theoretical prediction regarding the circumstances under which the display advertising industry would benefit if it moved to a partially or fully time-based standard.  ...  Note, then that utility maximization implies a price of ν (s * EX), yielding a revenue of ν (s * EX)s * EX.  ... 
doi:10.1145/2229012.2229059 dblp:conf/sigecom/GoldsteinMS12 fatcat:fbjeftvyqba5fm5ws3tckef6ie

Combining Keyword Search Advertisement and Site- Targeted Advertisement in Search Engine Advertising

Li Chen
2008 Journal of Service Science and Management  
Closed-form solutions are calculated for two applications: (1) Advertising of perishable information with click-based revenue only; and (2) Site-targeted advertisement first and keyword search advertisement  ...  While keyword search advertisement is a cost-efficient way of advertising, site-targeted advertisement provides a quicker alternative to expose the ad to a mass population at a higher expense.  ...  Under this scenario, our main concern is to find the optimal ending time of both types of ads to maximize of the advertisers' revenue given a budget constraint.  ... 
doi:10.4236/jssm.2008.13025 fatcat:lusdgdyyznbb7hpbqqmbp637k4

Yield Optimization of Display Advertising with Ad Exchange [article]

Santiago Balseiro and Jon Feldman and Vahab Mirrokni and S. Muthukrishnan
2012 arXiv   pre-print
We compare parametric and non-parametric ways to estimate from data both analytically and experimentally in the special case without the ad exchange, and show that though both methods converge to the optimal  ...  to the optimal policy.  ...  When all contracts are fulfilled, impressions are sent to AdX with the revenue maximizing price p * (0).  ... 
arXiv:1102.2551v2 fatcat:zavlyotvfbhndk7sqckym662xe

On the value of using group discounts under price competition

Reshef Meir, Tyler Lu, Moshe Tennenholtz, Craig Boutilier
2014 Artificial Intelligence  
We analyze this problem from the viewpoint of the vendors, asking under what conditions a vendor should adopt a volume-based price schedule rather than posting a fixed price.  ...  The increasing use of group discounts has provided opportunities for buying groups with diverse preferences to coordinate their behavior in order to exploit the best offers from multiple vendors.  ...  Thus the revenue of any discount schedule p for the single vendor under distribution D is equal to the revenue it derives using p when faced with vendors posting prices q 2 , . . . , q m under distribution  ... 
doi:10.1016/j.artint.2014.07.002 fatcat:eyezxmkwtzav7dm3v72oji4gia

An Online Auction Mechanism for Dynamic Virtual Cluster Provisioning in Geo-Distributed Clouds

Weijie Shi, Chuan Wu, Zongpeng Li
2017 IEEE Transactions on Parallel and Distributed Systems  
involve NP-hard problems, which are non-trivial to solve offline, not to mention if an online efficient algorithm is sought; (2) an efficient pricing mechanism is missing, which charges a market-driven  ...  price for each VC as a whole upon request, while maximizing system efficiency or provider revenue over the entire span.  ...  user n, i.e., set x n,β = 0, ∀β ∈ B Finally, we can still apply the revenue maximizing technique introduced in Sec. 5 to design a revenue maximizing online auction for the non-linear operational cost  ... 
doi:10.1109/tpds.2016.2601905 fatcat:n4srd3avxrbc3dawzlqrpqyef4

Algorithmic Methods for Sponsored Search Advertising [article]

Jon Feldman, S. Muthukrishnan
2008 arXiv   pre-print
Such sponsored search relies on market mechanisms to elicit prices for these advertisements, making use of an auction among advertisers who bid in order to have their ads shown for specific keywords.  ...  Modern commercial Internet search engines display advertisements along side the search results in response to user queries.  ...  The work in [18] is focused on click-maximization. 9 We present the efficient mechanism of [18] for Offline Ad Slot Scheduling, which is truthful under click-maximization.  ... 
arXiv:0805.1759v1 fatcat:2jcmu5uq5zghxe7egqeb2ugwby

Exploiting network effects in the provisioning of large scale systems

Jayakrishnan Nair, Adam Wierman, Bert Zwart
2011 Performance Evaluation Review  
A majority of these services are supported by advertising and are offered for free to the end user.  ...  We study the problem of optimal capacity provisioning for a profit maximizing firm operating such an online service in the asymptotic regime of a large market size.  ...  Firstly, a majority of these online services are offered for free to the end user, the firm (or service provider) deriving its revenue via advertising.  ... 
doi:10.1145/2034832.2034837 fatcat:xdr3g5dpazf2bjpsis5qrpqfnu
« Previous Showing results 1 — 15 out of 3,392 results