Mahsa Derakhshan

Publication Activity (10 Years)

Years Active: 2016-2024
Publications (10 Years): 45

Top Topics

Massively Parallel

Online Learning

Stage Stochastic Programs

Top Venues

Publications

Mahsa Derakhshan, Emily Ryu, S. Matthew Weinberg, Eric Xue
Settling the Competition Complexity of Additive Buyers over Independent Items. CoRR (2024)
Mark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi, David Wajc
New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. CoRR (2024)
Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab
Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation. STOC (2023)
Mahsa Derakhshan, Mohammad Saneian
Query Efficient Weighted Stochastic Matching. CoRR (2023)
Mahsa Derakhshan, Alireza Farhadi
Beating (1 - 1/e)-Approximation for Weighted Stochastic Matching. SODA (2023)
Simina Brânzei, Mahsa Derakhshan, Negin Golrezaei, Yanjun Han
Online Learning in Multi-unit Auctions. CoRR (2023)
Simina Brânzei, Mahsa Derakhshan, Negin Golrezaei, Yanjun Han
Learning and Collusion in Multi-unit Auctions. NeurIPS (2023)
Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin
Fast and Simple Solutions of Blotto Games. Oper. Res. 71 (2) (2023)
Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab
Stochastic Minimum Vertex Cover in General Graphs: a 3/2-Approximation. CoRR (2023)
Mark Braverman, Mahsa Derakhshan, Antonio Molina Lovett
Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark. EC (2022)
Mark Braverman, Mahsa Derakhshan, Antonio Molina Lovett
Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark. CoRR (2022)
Mahsa Derakhshan, Negin Golrezaei, Renato Paes Leme
Linear Program-Based Approximation for Personalized Reserve Prices. Manag. Sci. 68 (3) (2022)
Mahsa Derakhshan, Negin Golrezaei, Vahideh H. Manshadi, Vahab Mirrokni
Product Ranking on Online Platforms. Manag. Sci. 68 (6) (2022)
Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan
Stochastic Vertex Cover with Few Queries. SODA (2022)
Mahsa Derakhshan, Alireza Farhadi
Beating (1-1/e)-Approximation for Weighted Stochastic Matching. CoRR (2022)
Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan
Stochastic Vertex Cover with Few Queries. CoRR (2021)
Mahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins
Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions. SODA (2021)
Soheil Behnezhad, Mahsa Derakhshan
Stochastic Weighted Matching: $(1-ε)$ Approximation. CoRR (2020)
Mahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins
Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions. CoRR (2020)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi
Stochastic matching with few queries: (1-ε) approximation. STOC (2020)
Soheil Behnezhad, Mahsa Derakhshan
Stochastic Weighted Matching: (Stochastic Weighted Matching: (1-ε) Approximation -\varepsilon$) Approximation. FOCS (2020)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi
Stochastic Matching with Few Queries: (1-ε) Approximation. CoRR (2020)
Mahsa Derakhshan, Negin Golrezaei, Vahideh H. Manshadi, Vahab S. Mirrokni
Product Ranking on Online Platforms. EC (2020)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. CoRR (2019)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. FOCS (2019)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh
Streaming and Massively Parallel Algorithms for Edge Coloring. ESA (2019)
Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin
Optimal Strategies of Blotto Games: Beyond Convexity. CoRR (2019)
Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani
Stochastic Matching on Uniformly Sparse Graphs. SAGT (2019)
Soheil Behnezhad, Sebastian Brandt, Mahsa Derakhshan, Manuela Fischer, MohammadTaghi Hajiaghayi, Richard M. Karp, Jara Uitto
Massively Parallel Computation of Matching and MIS in Sparse Graphs. PODC (2019)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. DISC (2019)
Mahsa Derakhshan, Negin Golrezaei, Renato Paes Leme
LP-based Approximation for Personalized Reserve Prices. CoRR (2019)
Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin
Optimal Strategies of Blotto Games: Beyond Convexity. EC (2019)
Mahsa Derakhshan, Negin Golrezaei, Renato Paes Leme
LP-based Approximation for Personalized Reserve Prices. EC (2019)
MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni
Brief Announcement: MapReduce Algorithms for Massive Trees. ICALP (2018)
Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark
From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games. SODA (2018)
MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni
Massively Parallel Dynamic Programming on Trees. CoRR (2018)
Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin
Spatio-Temporal Games Beyond One Dimension. EC (2018)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Richard M. Karp
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching. CoRR (2018)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi
Brief Announcement: Semi-MapReduce Meets Congested Clique. CoRR (2018)
Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. AAAI (2017)
Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Aleksandrs Slivkins
A Polynomial Time Algorithm for Spatio-Temporal Security Games. CoRR (2017)
MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, Vahab S. Mirrokni
Affinity Clustering: Hierarchical Clustering at Scale. NIPS (2017)
Soheil Behnezhad, Mahsa Derakhshan, Hossein Esfandiari, Elif Tan, Hadi Yami
Brief Announcement: Graph Matching in Massive Datasets. SPAA (2017)
Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Aleksandrs Slivkins
A Polynomial Time Algorithm for Spatio-Temporal Security Games. EC (2017)
Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. CoRR (2016)