Stochastic budget optimization in internet advertising

DOI10.1007/s00453-012-9614-xzbMath1275.68037arXiv1001.2735OpenAlexW1658377931MaRDI QIDQ2392928

Yanyan Li

Publication date: 5 August 2013

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1001.2735

zbMATH Keywords

internet advertisingscenario modelstochastic budget optimization

Mathematics Subject Classification ID

Stochastic programming (90C15) Marketing, advertising (90B60) Experimental studies (91A90) Internet topics (68M11)

Related Items (3)

Adaptivity in the stochastic blackjack knapsack problem ⋮ Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem ⋮ Dynamic budget allocation for social media advertising campaigns: optimization and learning

Cites Work

• Stochastic models for budget optimization in search-based advertising
• Scenario optimization
• Clique is hard to approximate within \(n^{1-\epsilon}\)
• Forward looking Nash equilibrium for keyword auction
• Parameterized Approximation Scheme for the Multiple Knapsack Problem
• Fast Approximation Algorithms for Knapsack Problems
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
• Approximating the Cut-Norm via Grothendieck's Inequality
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stochastic budget optimization in internet advertising