arXiv cs.LG
· Papers
Reoptimization Algorithms for Contextual Bandits with Knapsack Constraints
arXiv:2608.11383v1 Announce Type: new Abstract: We study new algorithms for Contextual Bandits with Knapsack. In these problems, there are finitely many types of customers, products, and resources. Each product is made from a fixed combination of resources, and resources have finite capacity. A decision maker must assi