Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates
DGX agentarXiv:2607.02150v1 Announce Type: cross Abstract: This paper studies additive regret in the multi-secretary problem, defined as the gap between the expected offline prophet reward and the reward of th