↻
Nikhil Garg reposted
Aaron Roth
@aaroth.bsky.social
A world without open problems Here are some that fell today: K-server: arxiv.org/abs/2609.15979 Matroid Secretary: arxiv.org/abs/2609.145... Matrix Spencer: arxiv.org/abs/2609.15025 (Well Matrix Spencer was maybe also a few weeks ago, but who's counting? arxiv.org/abs/2608.288…
AI Weekly's analysis
→
- A new preprint claims a proof that the work function algorithm achieves competitive ratio k on every metric space, matching the known lower bound.
- The conjecture was introduced by Manasse, McGeoch and Sleator in 1988; the paper calls it the 'holy grail' of competitive analysis.
- The prior best general bound for the work function algorithm was 2k-1, due to Koutsoupias and Papadimitriou.
Read full analysis →
View on Bluesky →