Bandits with Knapsacks: Advice on Time-Varying Demands
Proceedings of the 40th International Conference on Machine Learning (ICML)
Saved in:
Main Authors: | Lyu, Lixing, Cheung, Wang Chi |
---|---|
Other Authors: | INDUSTRIAL SYSTEMS ENGINEERING AND MANAGEMENT |
Format: | Conference or Workshop Item |
Published: |
2023
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/244535 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Distributed bandit online convex optimization with time-varying coupled inequality constraints
by: Yi, Xinlei, et al.
Published: (2022) -
Stochastic knapsack revisited: The service level perspective
by: LYU, Guodong, et al.
Published: (2022) -
Study of knapsack cryptosystems
by: Sathia Seelan Vetrichelvan
Published: (2020) -
Best Arm Identification for Cascading Bandits in the Fixed Confidence Setting
by: Zhong, Zixin, et al.
Published: (2020) -
Solusi masalah knapsack collapsing dengan pendekatan masalah knapsack baku dan program dinamik
by: , INDARSIH, et al.
Published: (2002)