activity
20052026
most citedBeating 1-1/e for Ordered Prophets

61 citations · 206 across the 60 of their papers we have counts for

collaborators

70 papers

cs.CL2026★ 3 cited

Accelerating Scientific Research with Gemini: Case Studies and Common Techniques

David P. Woodruff, Vincent Cohen-Addad, Lalit Jain +33

Recent advances in large language models (LLMs) have opened new avenues for accelerating scientific research. While models are increasingly capable of assisting with routine tasks,…

cs.DS2023★ 2 cited

Dynamic Algorithms for Matroid Submodular Maximization

Kiarash Banihashem, Leyla Biabani, Samira Goudarzi +3

Submodular maximization under matroid and cardinality constraints are classical problems with a wide range of applications in machine learning, auction theory, and combinatorial op…

cs.DS2023

Trading Prophets

José Correa, Andrés Cristi, Paul Dütting +3

In this work we initiate the study of buy-and-sell prophet inequalities. We start by considering what is arguably the most fundamental setting. In this setting the online algorithm…

cs.DS2023

Dynamic Constrained Submodular Optimization with Polylogarithmic Update Time

Kiarash Banihashem, Leyla Biabani, Samira Goudarzi +3

Maximizing a monotone submodular function under cardinality constraint is a core problem in machine learning and database with many basic applications, including video and data…

cs.GT2023★ 1 cited

Delegating to Multiple Agents

MohammadTaghi Hajiaghayi, Keivan Rezaei, Suho Shin

We consider a multi-agent delegation mechanism without money. In our model, given a set of agents, each agent has a fixed number of solutions which is exogenous to the mechanism, a…

stat.ML2023

Optimal Sparse Recovery with Decision Stumps

Kiarash Banihashem, MohammadTaghi Hajiaghayi, Max Springer

Decision trees are widely used for their low computational cost, good predictive performance, and ability to assess the importance of features. Though often used in practice for fe…