Reoptimization Algorithms for Contextual Bandits with Knapsack Constraints
DGX agentarXiv: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. Ea