Explore
AI Tools
New Tools
AI Agents
One9 Worker
LLMs
RAG & Vector DBs
Research
Assemble a stack
Founder Stacks
Compare
How We Rate
About
$
/
₹
⌘K
Sign up free
Login
Back to papers
July 2, 2026
cs.DS
cs.LG
Tight Lower Bounds for the Multi-Secretary Problem via Bellman Certificates
Jiawei Zhang
Original Abstract
Read on arXiv
Download PDF
Categories
cs.DS, cs.LG