1 paper
Somangchan Park, Heesang Ann, Min-hwan Oh
We study the multi-objective linear contextual bandit problem, where multiple possible conflicting objectives must be optimized simultaneously. We propose \texttt{MOL-TS}, the \tex…