Does the Multisecretary Problem Always Have Bounded Regret?

Arlotto and Gurvich (2019) showed that the regret in the multisecretary problem is bounded in the number of job openings, n, and the number of applicants, k, provided that the applicant valuations are drawn from a distribution with finite support. I show that this result does not hold when applicant valuations are drawn from a standard uniform distribution. In this case, the regret is between log(n)/16 - 1/4 and log(n+1)/8, when k = n/2 and n ≥ 16. I establish these bounds with enhanced version of Vera and Banerjee's (2019) compensated coupling technique.