Adaptivity in the stochastic blackjack knapsack problem

DOI10.1016/j.tcs.2013.11.029zbMath1278.90282OpenAlexW2090297355MaRDI QIDQ385968

Asaf Levin, Aleksander Vainer

Publication date: 13 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.11.029

zbMATH Keywords

knapsack problembenefit of adaptivity

Mathematics Subject Classification ID

Stochastic programming (90C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Unnamed Item ⋮ Lower bounds on the adaptivity gaps in variants of the stochastic knapsack problem ⋮ Adaptive Bin Packing with Overflow

Cites Work

• Stochastic models for budget optimization in search-based advertising
• A PTAS for the chance-constrained knapsack problem with random item sizes
• Stochastic budget optimization in internet advertising
• The benefit of adaptivity in the stochastic knapsack problem with dependence on the state of nature
• A Preference Order Dynamic Program for a Knapsack Problem with Stochastic Rewards
• Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
• Stochastic Covering and Adaptivity
• Preference Order Stochastic Knapsack Problems: Methodological Issues
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Adaptivity in the stochastic blackjack knapsack problem