Exact Regret Frontiers and Externality Scheduling in Centralized Serial-Dictatorship Bandits
It is shown that the matching-level Graves-Lai constraints reduce to finitely many pairwise exploration quotas and, at top-choice-separated instances, yield a polynomial-size marginal linear program.
Li-Sha-Ge-Yuan-Yuan Xu, Guo-Dong Ma, Peng-Cheng Weng et al.
· 0 citations