Optimal Allocation for Chunked-Reward Advertising

DOI10.1007/978-3-642-45046-4_24zbMath1406.91222OpenAlexW2154587107MaRDI QIDQ2937765

Jian Li, Weihao Kong, Tao Qin, Tie-Yan Liu

Publication date: 12 January 2015

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45046-4_24

Mathematics Subject Classification ID

Dynamic programming (90C39) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Marketing, advertising (90B60)

Related Items (1)

Deals or No Deals: Contract Design for Online Advertising

Cites Work

• Unnamed Item
• Unnamed Item
• Simultaneous optimization via approximate majorization for concave profits or convex costs
• Online Scheduling of Jobs with Fixed Start Times on Related Machines
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• A Level Algorithm for Preemptive Scheduling
• STACS 2004
• Scheduling

This page was built for publication: Optimal Allocation for Chunked-Reward Advertising