default search action
Mahsa Derakhshan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c24]Mahsa Derakhshan, Emily Ryu, S. Matthew Weinberg, Eric Xue:
Settling the Competition Complexity of Additive Buyers over Independent Items. EC 2024: 420-446 - [i19]Mahsa Derakhshan, Emily Ryu, S. Matthew Weinberg, Eric Xue:
Settling the Competition Complexity of Additive Buyers over Independent Items. CoRR abs/2403.03937 (2024) - [i18]Mark Braverman, Mahsa Derakhshan, Tristan Pollner, Amin Saberi, David Wajc:
New Philosopher Inequalities for Online Bayesian Matching, via Pivotal Sampling. CoRR abs/2407.15285 (2024) - 2023
- [j3]Soheil Behnezhad, Sina Dehghani
, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Fast and Simple Solutions of Blotto Games. Oper. Res. 71(2): 506-516 (2023) - [c23]Simina Brânzei, Mahsa Derakhshan, Negin Golrezaei, Yanjun Han:
Learning and Collusion in Multi-unit Auctions. NeurIPS 2023 - [c22]Mahsa Derakhshan, Alireza Farhadi:
Beating (1 - 1/e)-Approximation for Weighted Stochastic Matching. SODA 2023: 1931-1961 - [c21]Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab:
Stochastic Minimum Vertex Cover in General Graphs: A 3/2-Approximation. STOC 2023: 242-253 - [i17]Mahsa Derakhshan, Naveen Durvasula, Nika Haghtalab:
Stochastic Minimum Vertex Cover in General Graphs: a 3/2-Approximation. CoRR abs/2302.02567 (2023) - [i16]Simina Brânzei, Mahsa Derakhshan, Negin Golrezaei, Yanjun Han:
Online Learning in Multi-unit Auctions. CoRR abs/2305.17402 (2023) - [i15]Mahsa Derakhshan, Mohammad Saneian:
Query Efficient Weighted Stochastic Matching. CoRR abs/2311.08513 (2023) - 2022
- [j2]Mahsa Derakhshan, Negin Golrezaei
Linear Program-Based Approximation for Personalized Reserve Prices. Manag. Sci. 68(3): 1849-1864 (2022) - [j1]Mahsa Derakhshan, Negin Golrezaei
Product Ranking on Online Platforms. Manag. Sci. 68(6): 4024-4041 (2022) - [c20]Mark Braverman, Mahsa Derakhshan, Antonio Molina Lovett:
Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark. EC 2022: 967-985 - [c19]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan:
Stochastic Vertex Cover with Few Queries. SODA 2022: 1808-1846 - [i14]Mark Braverman, Mahsa Derakhshan, Antonio Molina Lovett:
Max-Weight Online Stochastic Matching: Improved Approximations Against the Online Benchmark. CoRR abs/2206.01270 (2022) - [i13]Mahsa Derakhshan, Alireza Farhadi:
Beating (1-1/e)-Approximation for Weighted Stochastic Matching. CoRR abs/2210.17515 (2022) - 2021
- [b1]Mahsa Derakhshan:
Algorithms for Markets: Matching and Pricing. University of Maryland, College Park, MD, USA, 2021 - [c18]Mahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins:
Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions. SODA 2021: 1099-1118 - [i12]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan:
Stochastic Vertex Cover with Few Queries. CoRR abs/2112.05415 (2021) - 2020
- [c17]Soheil Behnezhad, Mahsa Derakhshan:
Stochastic Weighted Matching: (Stochastic Weighted Matching: (1-ε) Approximation -\varepsilon$) Approximation. FOCS 2020: 1392-1403 - [c16]Mahsa Derakhshan, Negin Golrezaei, Vahideh H. Manshadi, Vahab S. Mirrokni:
Product Ranking on Online Platforms. EC 2020: 459 - [c15]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Stochastic matching with few queries: (1-ε) approximation. STOC 2020: 1111-1124 - [i11]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Stochastic Matching with Few Queries: (1-ε) Approximation. CoRR abs/2002.11880 (2020) - [i10]Soheil Behnezhad, Mahsa Derakhshan:
Stochastic Weighted Matching: $(1-ε)$ Approximation. CoRR abs/2004.08703 (2020) - [i9]Mahsa Derakhshan, David M. Pennock, Aleksandrs Slivkins:
Beating Greedy For Approximating Reserve Prices in Multi-Unit VCG Auctions. CoRR abs/2007.12653 (2020)
2010 – 2019
- 2019
- [c14]Mahsa Derakhshan, Negin Golrezaei, Renato Paes Leme:
LP-based Approximation for Personalized Reserve Prices. EC 2019: 589 - [c13]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin:
Optimal Strategies of Blotto Games: Beyond Convexity. EC 2019: 597-616 - [c12]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Streaming and Massively Parallel Algorithms for Edge Coloring. ESA 2019: 15:1-15:14 - [c11]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. FOCS 2019: 382-405 - [c10]Soheil Behnezhad, Sebastian Brandt
Massively Parallel Computation of Matching and MIS in Sparse Graphs. PODC 2019: 481-490 - [c9]Soheil Behnezhad, Mahsa Derakhshan, Alireza Farhadi, MohammadTaghi Hajiaghayi, Nima Reyhani:
Stochastic Matching on Uniformly Sparse Graphs. SAGT 2019: 357-373 - [c8]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Marina Knittel, Hamed Saleh:
Brief Announcement: Streaming and Massively Parallel Algorithms for Edge Coloring. DISC 2019: 36:1-36:3 - [i8]Soheil Behnezhad, Avrim Blum, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Christos H. Papadimitriou, Saeed Seddighin:
Optimal Strategies of Blotto Games: Beyond Convexity. CoRR abs/1901.04153 (2019) - [i7]Mahsa Derakhshan, Negin Golrezaei, Renato Paes Leme:
LP-based Approximation for Personalized Reserve Prices. CoRR abs/1905.01526 (2019) - [i6]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. CoRR abs/1909.03478 (2019) - 2018
- [c7]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Brief Announcement: MapReduce Algorithms for Massive Trees. ICALP 2018: 162:1-162:4 - [c6]Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Spatio-Temporal Games Beyond One Dimension. EC 2018: 411-428 - [c5]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: 2291-2310 - [i5]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi:
Brief Announcement: Semi-MapReduce Meets Congested Clique. CoRR abs/1802.10297 (2018) - [i4]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Richard M. Karp:
Massively Parallel Symmetry Breaking on Sparse Graphs: MIS and Maximal Matching. CoRR abs/1807.06701 (2018) - [i3]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Vahab S. Mirrokni:
Massively Parallel Dynamic Programming on Trees. CoRR abs/1809.03685 (2018) - 2017
- [c4]Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Saeed Seddighin:
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. AAAI 2017: 369-375 - [c3]MohammadHossein Bateni, Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Raimondas Kiveris, Silvio Lattanzi, Vahab S. Mirrokni:
Affinity Clustering: Hierarchical Clustering at Scale. NIPS 2017: 6864-6874 - [c2]Soheil Behnezhad, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Aleksandrs Slivkins:
A Polynomial Time Algorithm for Spatio-Temporal Security Games. EC 2017: 697-714 - [c1]Soheil Behnezhad, Mahsa Derakhshan, Hossein Esfandiari, Elif Tan, Hadi Yami:
Brief Announcement: Graph Matching in Massive Datasets. SPAA 2017: 133-136 - [i2]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Aleksandrs Slivkins:
A Polynomial Time Algorithm for Spatio-Temporal Security Games. CoRR abs/1706.05711 (2017) - 2016
- [i1]Soheil Behnezhad, Sina Dehghani, Mahsa Derakhshan, Mohammad Taghi Hajiaghayi, Saeed Seddighin:
Faster and Simpler Algorithm for Optimal Strategies of Blotto Game. CoRR abs/1612.04029 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-19 23:11 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: