3 papers
cs.DS2025
Nearly Tight Sample Complexity for Matroid Online Contention Resolution
Moran Feldman, Ola Svensson, Rico Zenklusen
Due to their numerous applications, in particular in Mechanism Design, Prophet Inequalities have experienced a surge of interest. They describe competitive ratios for basic stoppin…
cs.CY2024
Could ChatGPT get an Engineering Degree? Evaluating Higher Education Vulnerability to AI Assistants
Beatriz Borges, Negar Foroutan, Deniz Bayazit +87
AI assistants are being increasingly used by students enrolled in higher education institutions. While these tools provide opportunities for improved teaching and education, they a…
cs.DS2023
An Analysis of seeding for -means
Etienne Bamas, Sai Ganesh Nagarajan, Ola Svensson
One of the most popular clustering algorithms is the celebrated seeding algorithm (also know as -means++ when ) by Arthur and Vassilvitskii (2007), who showed that it…