Mahsa Derakhshan

According to our database, Mahsa Derakhshan authored at least 33 papers between 2017 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Settling the Competition Complexity of Additive Buyers over Independent Items.

Mahsa Derakhshan, Emily Ryu, S. Matthew Weinberg, Eric Xue

CoRR, 2024

2023

Fast and Simple Solutions of Blotto Games.

Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin

Oper. Res., March, 2023

Query Efficient Weighted Stochastic Matching.

Mahsa Derakhshan, Mohammad Saneian

CoRR, 2023

Online Learning in Multi-unit Auctions.

Simina Brânzei, Mahsa Derakhshan, Negin Golrezaei, Yanjun Han

CoRR, 2023

Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation.

Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

Beating (1 - 1/e)-Approximation for Weighted Stochastic Matching.

Mahsa Derakhshan, Alireza Farhadi

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Learning and Collusion in Multi-unit Auctions.

Simina Brânzei, Mahsa Derakhshan, Negin Golrezaei, Yanjun Han

Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022

Product Ranking on Online Platforms.

Mahsa Derakhshan, Negin Golrezaei, Vahideh H. Manshadi, Vahab Mirrokni

Manag. Sci., 2022

Linear Program-Based Approximation for Personalized Reserve Prices.

Mahsa Derakhshan, Negin Golrezaei, Renato Paes Leme

Manag. Sci., 2022

Stochastic Vertex Cover with Few Queries.

Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark.

Mark Braverman, Mahsa Derakhshan, Antonio Molina Lovett

Proceedings of the EC '22: The 23rd ACM Conference on Economics and Computation, Boulder, CO, USA, July 11, 2022

2021

Algorithms for Markets: Matching and Pricing.

Mahsa Derakhshan

PhD thesis, 2021

Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions.

Mahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020

Stochastic Weighted Matching: $(1-ε)$ Approximation.

Soheil Behnezhad, Mahsa Derakhshan

CoRR, 2020

Stochastic matching with few queries: (1-ε) approximation.

Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi

Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

Stochastic Weighted Matching: (Stochastic Weighted Matching: (1-ε) Approximation -\varepsilon$) Approximation.

Soheil Behnezhad, Mahsa Derakhshan

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring.

Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh

Proceedings of the 33rd International Symposium on Distributed Computing, 2019

Stochastic Matching on Uniformly Sparse Graphs.

Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani

Proceedings of the Algorithmic Game Theory - 12th International Symposium, 2019

Massively Parallel Computation of Matching and MIS in Sparse Graphs.

Soheil Behnezhad, Sebastian Brandt, Mahsa Derakhshan, Manuela Fischer, MohammadTaghi Hajiaghayi, Richard M. Karp, Jara Uitto

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, 2019

Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time.

Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan

Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

Streaming and Massively Parallel Algorithms for Edge Coloring.

Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

LP-based Approximation for Personalized Reserve Prices.

Mahsa Derakhshan, Negin Golrezaei, Renato Paes Leme

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

Optimal Strategies of Blotto Games: Beyond Convexity.

Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin

Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

2018

Massively Parallel Dynamic Programming on Trees.

MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni

CoRR, 2018

Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching.

Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Richard M. Karp

CoRR, 2018

Brief Announcement: Semi-MapReduce Meets Congested Clique.

Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi

CoRR, 2018

From Battlefields to Elections: Winning Strategies of Blotto and Auditing Games.

Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Mohammad Mahdian, Christos H. Papadimitriou, Ronald L. Rivest, Saeed Seddighin, Philip B. Stark

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Spatio-Temporal Games Beyond One Dimension.

Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin

Proceedings of the 2018 ACM Conference on Economics and Computation, 2018

Brief Announcement: MapReduce Algorithms for Massive Trees.

MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni

Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017

Brief Announcement: Graph Matching in Massive Datasets.

Soheil Behnezhad, Mahsa Derakhshan, Hossein Esfandiari, Elif Tan, Hadi Yami

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

A Polynomial Time Algorithm for Spatio-Temporal Security Games.

Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Aleksandrs Slivkins

Proceedings of the 2017 ACM Conference on Economics and Computation, 2017

Affinity Clustering: Hierarchical Clustering at Scale.

MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, Vahab S. Mirrokni

Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Faster and Simpler Algorithm for Optimal Strategies of Blotto Game.

Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017