most citedData-driven Policy on Feasibility Determination for the Train Shunting Problem

2 citations · 4 across the 2 of their papers we have counts for

collaborators
Showing stat.MLShow all

1 paper · 1 filter

stat.ML2020★ 2 cited

Algorithms for slate bandits with non-separable reward functions

Jason Rhuggenaath, Alp Akcay, Yingqian Zhang +1

In this paper, we study a slate bandit problem where the function that determines the slate-level reward is non-separable: the optimal value of the function cannot be determined by…