Abstract
We study the following TV ad placement problem: m identical time-slots are on sell within a period of m days and only one time-slot is available each day. Advertisers arrive online to bid for some time-slots to publish their ads. Typically, advertiser i arrives at the a i ’th day and wishes that her ad would be published for at most s i days. The ad cannot be published after its expiration time, the d i ’th day. If the ad is published for x i ≤ s i days, the total value of the ad for advertiser i is x i ·v i ; otherwise, the value of the ad to be published for each day diminishes and the total value is always s i ·v i . Our goal is to maximize the social welfare: the sum of values of the published ads. As usual in many online mechanisms, we are aiming to optimize the competitive ratio: the worst ratio between the optimal social welfare and the social welfare achieved by our mechanism.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
