Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (Q5219671): Difference between revisions

Revision as of 01:44, 22 July 2024

scientific article; zbMATH DE number 7179857

Language	Label	Description	Also known as
English	Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms	scientific article; zbMATH DE number 7179857

Statements

instance of

scholarly article

0 references

title

Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms (English)

0 references

author

Will Ma

0 references

published in

Mathematics of Operations Research

0 references

publication date

12 March 2020

0 references

full work available at URL

https://arxiv.org/abs/1306.1149

0 references

https://semanticscholar.org/paper/cccd1068a56a5f25cf88f1d6c57fce5519333b11

0 references

zbMATH Keywords

approximation algorithms

0 references

stochastic knapsack

0 references

Markovian multi-armed bandit

0 references

stochastic programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On the Adaptivity Gap of Stochastic Orienteering

0 references

When LP is the cure for your matching woes: improved bounds for stochastic matchings

0 references

Q4368722

0 references

A Learning Approach for Interactive Marketing to a Customer Segment

0 references

Q5365145

0 references

Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems

0 references

An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns

0 references

Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity

0 references

The Irrevocable Multiarmed Bandit Problem

0 references

Multi‐Armed Bandit Allocation Indices

0 references

Q3549602

0 references

Q2934609

0 references

Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits

0 references

Running Errands in Time: Approximation Algorithms for Stochastic Orienteering

0 references

TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards

0 references

Allocating Bandwidth for Bursty Connections

0 references

Stochastic combinatorial optimization via poisson approximation

0 references

Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract

0 references

Approximation in stochastic scheduling

0 references

Scheduling

0 references

On a Chebyshev-Type Inequality for Sums of Independent Random Variables

0 references

Q2768404

0 references

Identifiers

zbMATH Open document ID

1440.90035

0 references

DOI

10.1287/moor.2017.0884

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5219671

@@ Property / cites work @@
+On the Adaptivity Gap of Stochastic Orienteering
@@ Property / cites work: On the Adaptivity Gap of Stochastic Orienteering / rank @@
+Normal rank
@@ Property / cites work @@
+When LP is the cure for your matching woes: improved bounds for stochastic matchings
+Normal rank
@@ Property / cites work @@
+Q4368722
@@ Property / cites work: Q4368722 / rank @@
+Normal rank
@@ Property / cites work @@
+A Learning Approach for Interactive Marketing to a Customer Segment
+Normal rank
@@ Property / cites work @@
+Q5365145
@@ Property / cites work: Q5365145 / rank @@
+Normal rank
@@ Property / cites work @@
+Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
+Normal rank
@@ Property / cites work @@
+An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
+Normal rank
@@ Property / cites work @@
+Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
+Normal rank
@@ Property / cites work @@
+The Irrevocable Multiarmed Bandit Problem
@@ Property / cites work: The Irrevocable Multiarmed Bandit Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Multi‐Armed Bandit Allocation Indices
@@ Property / cites work: Multi‐Armed Bandit Allocation Indices / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549602
@@ Property / cites work: Q3549602 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934609
@@ Property / cites work: Q2934609 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation Algorithms for Correlated Knapsacks and Non-martingale Bandits
+Normal rank
@@ Property / cites work @@
+Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
+Normal rank
@@ Property / cites work @@
+TECHNICAL NOTE—The Adaptive Knapsack Problem with Stochastic Rewards
+Normal rank
@@ Property / cites work @@
+Allocating Bandwidth for Bursty Connections
@@ Property / cites work: Allocating Bandwidth for Bursty Connections / rank @@
+Normal rank
@@ Property / cites work @@
+Stochastic combinatorial optimization via poisson approximation
+Normal rank
@@ Property / cites work @@
+Improvements and Generalizations of Stochastic Knapsack and Multi-Armed Bandit Approximation Algorithms: Extended Abstract
+Normal rank
@@ Property / cites work @@
+Approximation in stochastic scheduling
@@ Property / cites work: Approximation in stochastic scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling
@@ Property / cites work: Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+On a Chebyshev-Type Inequality for Sums of Independent Random Variables
+Normal rank
@@ Property / cites work @@
+Q2768404
@@ Property / cites work: Q2768404 / rank @@
+Normal rank