Stochastic models for budget optimization in search-based advertising

DOI10.1007/s00453-009-9311-6zbMath1206.91045OpenAlexW2142094448MaRDI QIDQ603917

Sumit K. Garg

Publication date: 8 November 2010

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.341.9762

zbMATH Keywords

stochastic optimizationmodellingapproximation algorithmsadvertising auctionsbidsbudget optimization problem

Mathematics Subject Classification ID

Stochastic programming (90C15) Optimal stochastic control (93E20) Applications of stochastic analysis (to PDEs, etc.) (60H30) Auctions, bargaining, bidding and selling, and other market models (91B26) Marketing, advertising (90B60)

Related Items (5)

Optimal Budget Allocation Across Search Advertising Markets ⋮ Stochastic budget optimization in internet advertising ⋮ 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

• The Sample Average Approximation Method for Stochastic Discrete Optimization
• A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
• AdWords and generalized online matching
• A Knapsack Secretary Problem with Applications
• Preference Order Stochastic Knapsack Problems: Methodological Issues
• An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
• Allocating Bandwidth for Bursty Connections
• Approximation Algorithms for 2-Stage Stochastic Optimization Problems
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: Stochastic models for budget optimization in search-based advertising