Logarithmic regret in the dynamic and stochastic knapsack problem with equal rewards

We study a dynamic and stochastic knapsack problem in which a decision maker is sequentially presented with items arriving according to a Bernoulli process over $n$ discrete time periods. Items have equal rewards and independent weights that are drawn from a known non-negative continuous distributio...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Arlotto, Alessandro, Xie, Xinchang
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms Computer Science - Discrete Mathematics Mathematics - Optimization and Control Mathematics - Probability
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!