Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVahideh H. Manshadi
Person information
- affiliation: Yale University, USA
- affiliation (former): Operations Research Center, MIT
- affiliation (former): Department of Electrical Engineering, Stanford University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Negin Golrezaei
, Vahideh H. Manshadi, Jon Schneider, Shreyas Sekar:
Learning Product Rankings Robust to Fake Users. Oper. Res. 71(4): 1171-1196 (2023)- [j14]Jerry Anunrojwong, Krishnamurthy Iyer, Vahideh H. Manshadi:
Information Design for Congested Social Services: Optimal Need-Based Persuasion. Manag. Sci. 69(7): 3778-3796 (2023) - [j13]Nicole Immorlica, Brendan Lucier, Vahideh H. Manshadi, Alexander Wei:
Designing Approximately Optimal Search on Matching Platforms. Manag. Sci. 69(8): 4609-4626 (2023) - [j12]Vahideh H. Manshadi, Rad Niazadeh, Scott Rodilitz:
Fair Dynamic Rationing. Manag. Sci. 69(11): 6818-6836 (2023) - 2022
- [j11]Mahsa Derakhshan, Negin Golrezaei, Vahideh H. Manshadi, Vahab Mirrokni:
Product Ranking on Online Platforms. Manag. Sci. 68(6): 4024-4041 (2022) - [j10]Vahideh H. Manshadi, Scott Rodilitz:
Online Policies for Efficient Volunteer Crowdsourcing. Manag. Sci. 68(9): 6572-6590 (2022) - [j9]Saed Alizamir, Ningyuan Chen, Sang-Hyun Kim, Vahideh H. Manshadi:
Impact of Network Structure on New Service Pricing. Math. Oper. Res. 47(3): 1999-2033 (2022) - [c17]Vahideh H. Manshadi, Scott Rodilitz, Daniela Sabán, Akshaya Suresh:
Online Algorithms for Matching Platforms with Multi-Channel Traffic. EC 2022: 986-987 - [i16]Vahideh H. Manshadi, Scott Rodilitz, Daniela Sabán, Akshaya Suresh:
Online Algorithms for Matching Platforms with Multi-Channel Traffic. CoRR abs/2203.15037 (2022) - 2021
- [j8]Dawsen Hwang, Patrick Jaillet, Vahideh H. Manshadi:
Online Resource Allocation Under Partially Predictable Demand. Oper. Res. 69(3): 895-915 (2021) - [j7]Gad Allon, Kimon Drakopoulos, Vahideh H. Manshadi:
Information Inundation on Platforms and Implications. Oper. Res. 69(6): 1784-1804 (2021) - [c16]Negin Golrezaei, Vahideh H. Manshadi, Jon Schneider, Shreyas Sekar:
Learning Product Rankings Robust to Fake Users. EC 2021: 560-561 - [c15]Nicole Immorlica, Brendan Lucier, Vahideh H. Manshadi, Alexander Wei:
Designing Approximately Optimal Search on Matching Platforms. EC 2021: 632-633 - [c14]Vahideh H. Manshadi, Rad Niazadeh, Scott Rodilitz:
Fair Dynamic Rationing. EC 2021: 694-695 - [i15]Vahideh H. Manshadi, Rad Niazadeh, Scott Rodilitz:
Fair Dynamic Rationing. CoRR abs/2102.01240 (2021) - [i14]Nicole Immorlica, Brendan Lucier, Vahideh H. Manshadi, Alexander Wei:
Designing Approximately Optimal Search on Matching Platforms. CoRR abs/2102.09017 (2021) - 2020
- [j6]Vahideh H. Manshadi, Sidhant Misra, Scott Rodilitz:
Diffusion in Random Networks: Impact of Degree Distribution. Oper. Res. 68(6): 1722-1741 (2020) - [c13]Vahideh H. Manshadi, Scott Rodilitz:
Online Policies for Efficient Volunteer Crowdsourcing. EC 2020: 315-316 - [c12]Jerry Anunrojwong, Krishnamurthy Iyer, Vahideh H. Manshadi:
Information Design for Congested Social Services: Optimal Need-Based Persuasion. EC 2020: 349-350 - [c11]Mahsa Derakhshan, Negin Golrezaei, Vahideh H. Manshadi, Vahab S. Mirrokni:
Product Ranking on Online Platforms. EC 2020: 459 - [i13]Vahideh H. Manshadi, Scott Rodilitz:
Online Policies for Efficient Volunteer Crowdsourcing. CoRR abs/2002.08474 (2020) - [i12]Jerry Anunrojwong, Krishnamurthy Iyer, Vahideh H. Manshadi:
Information Design for Congested Social Services: Optimal Need-Based Persuasion. CoRR abs/2005.07253 (2020) - [i11]Irene Lo, Vahideh H. Manshadi, Scott Rodilitz, Ali Shameli:
Optimal Growth in Repeated Matching Platforms: Options versus Adoption. CoRR abs/2005.10731 (2020) - [i10]Negin Golrezaei, Vahideh H. Manshadi, Jon Schneider, Shreyas Sekar:
Learning Product Rankings Robust to Fake Users. CoRR abs/2009.05138 (2020)
2010 – 2019
- 2019
- [j5]Itai Ashlagi, Maximilien Burq, Patrick Jaillet, Vahideh H. Manshadi:
On Matching and Thickness in Heterogeneous Dynamic Markets. Oper. Res. 67(4): 927-949 (2019) - [c10]Gad Allon, Kimon Drakopoulos, Vahideh H. Manshadi:
Information Inundation on Platforms and Implications. EC 2019: 555-556 - 2018
- [j4]Virgile Galle, Vahideh H. Manshadi, S. Borjian Boroujeni, Cynthia Barnhart, Patrick Jaillet:
The Stochastic Container Relocation Problem. Transp. Sci. 52(5): 1035-1058 (2018) - [c9]Vahideh H. Manshadi, Sidhant Misra, Scott Rodilitz:
Diffusion in Random Networks: Impact of Degree Distribution. NetEcon@SIGMETRICS 2018: 7:1 - [i9]Dawsen Hwang, Patrick Jaillet, Vahideh H. Manshadi:
Online Resource Allocation under Partially Predictable Demand. CoRR abs/1810.00447 (2018) - 2017
- [i8]Virgile Galle, Setareh Borjian Boroujeni, Vahideh H. Manshadi, Cynthia Barnhart, Patrick Jaillet:
The Stochastic Container Relocation Problem. CoRR abs/1703.04769 (2017) - 2016
- [j3]Virgile Galle, S. Borjian Boroujeni, Vahideh H. Manshadi, Cynthia Barnhart, Patrick Jaillet:
An average-case asymptotic analysis of the Container Relocation Problem. Oper. Res. Lett. 44(6): 723-728 (2016) - [c8]Itai Ashlagi, Maximilien Burq, Patrick Jaillet, Vahideh H. Manshadi:
On Matching and Thickness in Heterogeneous Dynamic Markets. EC 2016: 765 - [i7]Vahideh H. Manshadi, Sidhant Misra:
A Generalized Bass Model for Product Growth in Networks. CoRR abs/1606.03386 (2016) - [i6]Itai Ashlagi, Maximilien Burq, Patrick Jaillet, Vahideh H. Manshadi:
On Matching and Thickness in Heterogeneous Dynamic Markets. CoRR abs/1606.03626 (2016) - 2015
- [i5]Setareh Borjian, Vahideh H. Manshadi, Cynthia Barnhart, Patrick Jaillet:
Managing Relocation and Delay in Container Terminals with Flexible Service Policies. CoRR abs/1503.01535 (2015) - [i4]Setareh Borjian, Virgile Galle, Vahideh H. Manshadi, Cynthia Barnhart, Patrick Jaillet:
Container Relocation Problem: Approximation, Asymptotic, and Incomplete Information. CoRR abs/1505.04229 (2015) - 2013
- [c7]Itai Ashlagi, Patrick Jaillet, Vahideh H. Manshadi:
Kidney exchange in dynamic sparse heterogenous pools. EC 2013: 25-26 - [i3]Itai Ashlagi, Patrick Jaillet, Vahideh H. Manshadi:
Kidney Exchange in Dynamic Sparse Heterogenous Pools. CoRR abs/1301.3509 (2013) - 2012
- [j2]Vahideh H. Manshadi, Shayan Oveis Gharan, Amin Saberi:
Online Stochastic Matching: Online Actions Based on Offline Statistics. Math. Oper. Res. 37(4): 559-573 (2012) - [c6]Arthur J. Friend, Vahideh H. Manshadi, Amin Saberi:
Distributed node placement algorithms for constructing well-connected sensor networks. INFOCOM 2012: 810-818 - [c5]Vahideh H. Manshadi, Amin Saberi:
Dynamics of prisoner's dilemma and the evolution of cooperation on networks. ITCS 2012: 227-235 - 2011
- [c4]Vahideh H. Manshadi, Shayan Oveis Gharan, Amin Saberi:
Online Stochastic Matching: Online Actions Based on Offline Statistics. SODA 2011: 1285-1294 - [i2]Vahideh H. Manshadi, Amin Saberi:
Prisoner's Dilemma on Graphs with Large Girth. CoRR abs/1102.1038 (2011) - 2010
- [i1]Vahideh H. Manshadi, Shayan Oveis Gharan, Amin Saberi:
Online Stochastic Matching: Online Actions Based on Offline Statistics. CoRR abs/1007.1673 (2010)
2000 – 2009
- 2009
- [j1]Hyunok Lee, Vahideh H. Manshadi, Donald C. Cox:
High-fidelity and time-driven simulation of large wireless networks with parallel processing. IEEE Commun. Mag. 47(3): 158-165 (2009) - [c3]Vahideh H. Manshadi, Ramesh Johari:
Supermodular network games. Allerton 2009: 1369-1376 - 2007
- [c2]Amin Firoozshahian, Vahideh H. Manshadi, Ashish Goel, Balaji Prabhakar:
Efficient, Fully Local Algorithms for CIOQ Switches. INFOCOM 2007: 2491-2495 - [c1]Hyunok Lee, Vahideh H. Manshadi, Donald C. Cox, Nim K. Cheung:
High Fidelity Simulation of Mobile Cellular Systems with Integrated Resource Allocation and Adaptive Antennas. WCNC 2007: 3210-3215
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-01-14 23:23 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:
