The Second-Price Knapsack Problem: Near-Optimal Real Time Bidding in Internet Advertisement

13 Mar 2020 Amar Jonathan Renegar Nicholas

In many online advertisement (ad) exchanges, ad slots are each sold via a separate second-price auction. This paper considers the bidder's problem of maximizing the value of ads they purchase in these auctions, subject to budget constraints... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • COMPUTER SCIENCE AND GAME THEORY
  • OPTIMIZATION AND CONTROL