{"id":200,"date":"2026-06-10T15:56:15","date_gmt":"2026-06-10T15:56:15","guid":{"rendered":"https:\/\/faculty.som.yale.edu\/vahidehmanshadi\/?page_id=200"},"modified":"2026-06-12T16:43:07","modified_gmt":"2026-06-12T16:43:07","slug":"publications-by-topic","status":"publish","type":"page","link":"https:\/\/faculty.som.yale.edu\/vahidehmanshadi\/publications-by-topic\/","title":{"rendered":"Publications"},"content":{"rendered":"\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Platform\/Policy Design for Social Good<\/strong><\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=5792202\" data-type=\"link\" data-id=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=5792202\">Offsetting Carbon with Lemons: Adverse Selection and Certification in the Voluntary Carbon Market<\/a>, with F. Monachou, and I. Morgenstern, Working paper, 2026.<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=5592190\">Who to Offer, and When: Redesigning Feeding America\u2019s Real-Time Donation Tool<\/a>, with S. Lee, and D. Saban, Working paper, 2025.<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=5179386\">Why the Rooney Rule Fumbles: Limitations of Interview-stage Diversity Interventions in Labor Markets<\/a>, with S. Farajollahzadeh, S. Lee, and F. Monachou, Major revision at&nbsp;<strong>Operations Research<\/strong>, 2025.\n<ul class=\"wp-block-list\">\n<li>Conference version accepted to&nbsp;<em>The 26th ACM Conference on Economics and Computation (EC)<\/em>, 2025<\/li>\n\n\n\n<li>Oral presentation at&nbsp;<em>The 5th ACM Conference on Equity &amp; Access in Algorithms, Mechanisms, &amp; Optimization (EAAMO)<\/em>, 2025<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=4748762\">Dynamic Matching with Post-Allocation Service and its Application to Refugee Resettlement<\/a>, with K. Bansak, S. Lee, R. Niazadeh, and E. Paulson,&nbsp;<strong>Management Science<\/strong>, 2025.\n<ul class=\"wp-block-list\">\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">First place, MSOM Best Student Paper Prize, 2024 \u2013 Entrant: S. Lee<\/mark><\/strong><\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">First place, Michael H. Rothkopf Junior Researcher Paper Prize (awarded by INFORMS Auctions and Market Design Section), 2024 \u2013 Entrant: S. Lee<\/mark><\/strong><\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Honorable mention, George Nicholson Student Paper Competition, 2025 \u2013 Entrant: S. Lee<\/mark><\/strong><\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Finalist, Service Science Best Student Paper Competition, 2025 \u2013 Entrant: S. Lee<\/mark><\/strong><\/li>\n\n\n\n<li>Conference version accepted to&nbsp;<em>The 25th ACM Conference on Economics and Computation (EC)<\/em>, 2024<\/li>\n\n\n\n<li>Extended abstract in&nbsp;<em>The fifth annual Symposium on Foundations of Responsible Computing (FORC)<\/em>, 2024<\/li>\n\n\n\n<li>Oral presentation at&nbsp;<em>The 4th ACM Conference on Equity &amp; Access in Algorithms, Mechanisms, &amp; Optimization (EAAMO)<\/em>, 2024<\/li>\n\n\n\n<li>Media: \u201c<a href=\"https:\/\/insights.som.yale.edu\/insights\/using-operations-research-to-improve-the-refugee-resettlement-process#:~:text=Research-,Using%20Operations%20Research%20to%20Improve%20the%20Refugee%20Resettlement%20Process,reducing%20caseloads%20of%20service%20providers\">Using Operations Research to Improve the Refugee Resettlement Process.<\/a>\u201d Yale Insights<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=4497747\">Redesigning VolunteerMatch\u2019s Ranking Algorithm: Toward More Equitable Access to Volunteers<\/a>, with S. Rodilitz, D. Saban, and A. Suresh,&nbsp;<strong>Management Science<\/strong>, 2025.\n<ul class=\"wp-block-list\">\n<li>Subsumes \u201cAnalytics for Societal Impact: Improving Access to Volunteers on VolunteerMatch\u201d<\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Honorable mention, Doing Good with Good OR Student Paper Competition, 2023 \u2013 Entrant: A. Suresh<\/mark><\/strong><\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Winner, INFORMS Public Sector OR Best Video Award, 2023<\/mark><\/strong>&nbsp;(See&nbsp;<a href=\"https:\/\/www.canva.com\/design\/DAFnK-457AQ\/08Rk1pwhT53l_-Y5MkAj7w\/watch?utm_content=DAFnK-457AQ&amp;utm_campaign=designshare&amp;utm_medium=link&amp;utm_source=publishsharelink\">here<\/a>)<\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Finalist, Revenue Management &amp; Pricing Practice Award, 2024<\/mark><\/strong><\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Finalist, INFORMS Public Sector OR Best Paper Award, 2024<\/mark><\/strong><\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Finalist, Service Science Best Student Paper Competition, 2024 \u2013 Entrant: A. Suresh<\/mark><\/strong><\/li>\n\n\n\n<li>Media: \u201c<a href=\"https:\/\/insights.som.yale.edu\/insights\/better-algorithm-can-bring-volunteers-to-more-organizations\">A Better Algorithm Can Bring Volunteers to More Organizations.<\/a>\u201d Yale Insights (covered on YaleNews)<\/li>\n\n\n\n<li>Accepted for presentation at the&nbsp;<em>MSOM Sustainable Operations SIG<\/em>, 2024<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=4347447\">Markovian Search with Socially Aware Constraints<\/a>, with M. R. Aminian and R. Niazadeh,&nbsp;<strong>Management Science<\/strong>, 2025.\n<ul class=\"wp-block-list\">\n<li>Subsumes \u201cFair Markovian Search\u201d<\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Third place, INFORMS Service Science Best Student Paper Award, 2023 \u2013 Entrant: M. R. Aminian<\/mark><\/strong><\/li>\n\n\n\n<li>Extended abstract in&nbsp;<em>The fifth annual Symposium on Foundations of Responsible Computing (FORC)<\/em>, 2024<\/li>\n\n\n\n<li>Oral presentation at&nbsp;<em>The 4th ACM Conference on Equity &amp; Access in Algorithms, Mechanisms, &amp; Optimization (EAAMO)<\/em>, 2024<\/li>\n\n\n\n<li>Media: \u201c<a href=\"https:\/\/www.chicagobooth.edu\/review\/algorithms-ai-can-make-hiring-more-diverse\">Algorithms and AI Can Make Hiring More Diverse.<\/a>\u201d Chicago Booth Review<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=4036904\">Online Algorithms for Matching Platforms with Multi-Channel Traffic<\/a>, with S. Rodilitz, D. Saban, and A. Suresh,&nbsp;<strong>Management Science<\/strong>, 2024.\n<ul class=\"wp-block-list\">\n<li>Conference version accepted to&nbsp;<em>The 23rd ACM Conference on Economics and Computation (EC)<\/em>, 2022<\/li>\n\n\n\n<li>Oral presentation at&nbsp;<em>The 2nd ACM Conference on Equity &amp; Access in Algorithms, Mechanisms, &amp; Optimization (EAAMO)<\/em>, 2022<\/li>\n\n\n\n<li>Media: \u201c<a href=\"https:\/\/anderson-review.ucla.edu\/matching-algorithms-work-fine-until-bypassed-by-external-links\/\">Matching Algorithms Work Fine\u2014Until Bypassed By External Links.<\/a>\u201d UCLA Anderson Review<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3802628\">Commitment on Volunteer Crowdsourcing Platforms: Implications for Growth and Engagement<\/a>, with I. Lo, A. Shameli, and S. Rodilitz,&nbsp;<strong>Manufacturing &amp; Service Operations Management<\/strong>, 2024.\n<ul class=\"wp-block-list\">\n<li>Conference version accepted to&nbsp;<em>The 25th ACM Conference on Economics and Computation (EC)<\/em>, 2024<\/li>\n\n\n\n<li>Media: \u201c<a href=\"https:\/\/anderson-review.ucla.edu\/how-nonprofits-can-better-engage-volunteers\/\">How Nonprofits Can Better Engage Volunteers.<\/a>\u201d UCLA Anderson Review<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3775895\">Fair Dynamic Rationing<\/a>, with R. Niazadeh and S. Rodilitz,&nbsp;<strong>Management Science<\/strong>, 2023.\n<ul class=\"wp-block-list\">\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">First place, Michael H. Rothkopf Junior Researcher Paper Prize, 2021 (Awarded by INFORMS Auctions and Market Design Section) \u2013 Entrant: R. Niazadeh<\/mark><\/strong><\/li>\n\n\n\n<li>Conference version appeared in&nbsp;<em>The 22nd ACM Conference on Economics and Computation (EC)<\/em>, 2021<\/li>\n\n\n\n<li>Extended abstract appeared in&nbsp;<em>The second annual Symposium on Foundations of Responsible Computing (FORC)<\/em>, 2021<\/li>\n\n\n\n<li>Spotlight presentation at&nbsp;<em>INFORMS Revenue Management and Pricing (RMP)<\/em>, 2021<\/li>\n\n\n\n<li>Oral presentation at&nbsp;<em>The 1st ACM Conference on Equity &amp; Access in Algorithms, Mechanisms, &amp; Optimization (EAAMO)<\/em>, 2021<\/li>\n\n\n\n<li>Accepted for presentation at the&nbsp;<em>MSOM Service SIG<\/em>, 2022&nbsp;<strong>(10 selected out of 84)<\/strong><\/li>\n\n\n\n<li>Media: \u201c<a href=\"https:\/\/review.chicagobooth.edu\/economics\/2021\/article\/how-ration-scarce-resources-fairly\">How to Ration Scarce Resources Fairly.<\/a>\u201d Chicago Booth Review<\/li>\n\n\n\n<li>Media: \u201c<a href=\"https:\/\/insights.som.yale.edu\/insights\/how-to-distribute-scarce-medical-supplies-in-pandemic-and-do-it-fairly\">How to Distribute Scarce Medical Supplies in a Pandemic\u2014and Do It Fairly.<\/a>\u201d Yale Insights<\/li>\n\n\n\n<li>Media: \u201c<a href=\"https:\/\/anderson-review.ucla.edu\/distributing-aid-fairly-amid-scarcity-and-unknown-demand\/\">Distributing Aid Fairly Amid Scarcity and Unknown Demand.<\/a>\u201d UCLA Anderson Review<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3849746\">Information Design for Congested Social Services: Optimal Need-Based Persuasion<\/a>, with J. Anunrojwong and K. Iyer,&nbsp;<strong>Management Science<\/strong>, 2023.\n<ul class=\"wp-block-list\">\n<li>Conference version appeared in&nbsp;<em>The 21st ACM Conference on Economics and Computation (EC)<\/em>, 2020<\/li>\n\n\n\n<li>Accepted for oral presentation at&nbsp;<em>The 4th Workshop on Mechanism Design for Social Good (MD4SG)<\/em>, 2020<\/li>\n\n\n\n<li>Accepted for presentation at the&nbsp;<em>MSOM Service SIG<\/em>, 2021&nbsp;<strong>(10 selected out of 100)<\/strong><\/li>\n\n\n\n<li>Featured Article: \u201c<a href=\"https:\/\/www.informs.org\/Blogs\/ManSci-Blogs\/Management-Science-Review\/Balancing-Needs-Information-Design-Mitigates-Congestion-in-Social-Services\">Balancing Needs: Information Design Mitigates Congestion in Social Services.<\/a>\u201d (Management Science Review)<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3802624\">Online Policies for Efficient Volunteer Crowdsourcing<\/a>, with S. Rodilitz,&nbsp;<strong>Management Science<\/strong>, 2022.\n<ul class=\"wp-block-list\">\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Second place, MSOM Best Student Paper Prize, 2021 \u2013 Entrant: S. Rodilitz<\/mark><\/strong><\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Third place, Michael H. Rothkopf Junior Researcher Paper Prize, 2020 (Awarded by INFORMS Auctions and Market Design Section \u2013 Entrant: S. Rodilitz)<\/mark><\/strong><\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Finalist, INFORMS Public Sector OR Best Paper Award, 2020<\/mark><\/strong><\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Finalist, INFORMS Service Science Best Student Paper Award, 2021 \u2013 Entrant: S. Rodilitz<\/mark><\/strong><\/li>\n\n\n\n<li>Conference version appeared in&nbsp;<em>The 21st ACM Conference on Economics and Computation (EC)<\/em>, 2020<\/li>\n\n\n\n<li>Accepted for oral presentation at&nbsp;<em>The 4th Workshop on Mechanism Design for Social Good (MD4SG)<\/em>, 2020<\/li>\n\n\n\n<li>Extended abstract appeared in&nbsp;<em>The second annual Symposium on Foundations of Responsible Computing (FORC)<\/em>, 2021<\/li>\n\n\n\n<li>Media: \u201c<a href=\"https:\/\/insights.som.yale.edu\/insights\/how-better-mobile-crowdsourcing-can-help-combat-food-waste-and-feed-the-hungry\">How Better Mobile Crowdsourcing Can Help Combat Food Waste and Feed the Hungry.<\/a>\u201d Yale Insights (also covered on&nbsp;<a href=\"https:\/\/www.informs.org\/About-INFORMS\/News-Room\/O.R.-and-Analytics-in-the-News\/How-Better-Mobile-Crowdsourcing-Can-Help-Combat-Food-Waste-and-Feed-the-Hungry\">O.R. and Analytics in the News<\/a>)<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3067596\">On Matching and Thickness in Heterogeneous Dynamic Markets<\/a>, with I. Ashlagi, M. Burq, and P. Jaillet,&nbsp;<strong>Operations Research<\/strong>, 2018. |&nbsp;<a href=\"https:\/\/www.youtube.com\/watch?v=ohmZUjxT6TY&amp;list=PLgKuh-lKre116D42VocUFnTH9teDTHEmx&amp;index=8\">Presentation Video<\/a>&nbsp;@ Simons\n<ul class=\"wp-block-list\">\n<li>Conference version appeared in&nbsp;<em>The 17th ACM Conference on Economics and Computation (EC)<\/em>, 2016<\/li>\n\n\n\n<li>Media: \u201c<a href=\"https:\/\/insights.som.yale.edu\/insights\/kidney-exchange-registries-should-collaborate-to-save-more-lives\">Kidney Exchange Registries Should Collaborate to Save More Lives.<\/a>\u201d Yale Insights<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"http:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/ajt.14566\/full\">The effect of match-run frequencies on the number of transplants and waiting times in kidney exchange<\/a>, with I. Ashlagi, A. Bingaman*, M. Burq, D. Gamarnik, C. Murphey*, A. E. Roth, M. L. Melcher*, and M. A. Rees*,&nbsp;<strong>American Journal of Transplantation<\/strong>, 2017.\n<ul class=\"wp-block-list\">\n<li>* designates medical collaborators<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/arxiv.org\/abs\/1301.3509\">Kidney exchange in dynamic sparse heterogenous pools<\/a>, with I. Ashlagi, and P. Jaillet,&nbsp;<strong>Proceedings of the 14th ACM Conference on Economics and Computation (EC)<\/strong>, 2013.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Online\/Matching Platforms<\/strong><\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=6481459\">How Much Should a Conversational Recommender System Converse?<\/a>, with A. Kumar and A. Tumu, Working paper, 2026.<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=4732158\">Robust Dynamic Staffing with Predictions<\/a>, with Y. Feng, R. Niazadeh, and S. Neyshabouri, Minor revision at&nbsp;<strong>Operations Research<\/strong>, 2026.\n<ul class=\"wp-block-list\">\n<li>Accepted for presentation at the&nbsp;<em>MSOM Service SIG<\/em>, 2024<\/li>\n\n\n\n<li>Conference version accepted to&nbsp;<em>The 26th ACM Conference on Economics and Computation (EC)<\/em>, 2025<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3850164\">Designing Approximately Optimal Search on Matching Platforms<\/a>, with N. Immorlica, B. Lucier, and A. Wei,&nbsp;<strong>Management Science<\/strong>, 2022.\n<ul class=\"wp-block-list\">\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Third place, Michael H. Rothkopf Junior Researcher Paper Prize, 2021 (Awarded by INFORMS Auctions and Market Design Section) \u2013 Entrant: A. Wei&nbsp;<\/mark><\/strong><\/li>\n\n\n\n<li>Conference version appeared in&nbsp;<em>The 22nd ACM Conference on Economics and Computation (EC)<\/em>, 2021<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3685465\">Learning Product Rankings Robust to Fake Users<\/a>, with N. Golrezaei, J. Schneider, and S. Sekar,&nbsp;<strong>Operations Research<\/strong>, 2022.\n<ul class=\"wp-block-list\">\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Winner, Best OM Paper in&nbsp;<em>Operations Research<\/em>&nbsp;Award, 2025<\/mark><\/strong><\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Finalist, INFORMS Data Mining Best Paper Competition, 2022<\/mark><\/strong><\/li>\n\n\n\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Winner, INFORMS MIF Paper Competition, 2023<\/mark><\/strong><\/li>\n\n\n\n<li>Conference version appeared in&nbsp;<em>The 22nd ACM Conference on Economics and Computation (EC)<\/em>, 2021<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3130378\">Product Ranking on Online Platforms<\/a>, with M. Derakhshan, N. Golrezaei, and V. Mirrokni,&nbsp;<strong>Management Science<\/strong>, 2020. |&nbsp;<a href=\"https:\/\/www.youtube.com\/watch?v=lCVNqUprumU\">Presentation Video<\/a> @ Google\n<ul class=\"wp-block-list\">\n<li>Conference version appeared in&nbsp;<em>The 21st ACM Conference on Economics and Computation (EC)<\/em>, 2020<\/li>\n\n\n\n<li>Accepted for presentation at the&nbsp;<em>MSOM Service SIG<\/em>, 2018&nbsp;<strong>(8 selected out of 66)<\/strong><\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3252231\">Online Resource Allocation under Partially Predictable Demand<\/a>, with D. Hwang and P. Jaillet,&nbsp;<strong>Operations Research<\/strong>, 2020. |&nbsp;<a href=\"https:\/\/www.birs.ca\/events\/2019\/5-day-workshops\/19w5231\/videos\/watch\/201901151448-Manshadi.html\">Presentation Video<\/a>&nbsp;@ BIRS<\/li>\n\n\n\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/moor.1120.0551\">Online stochastic matching: Online actions based on offline statistics<\/a>, with S. Oveis Gharan, A. Saberi,&nbsp;<strong>Mathematics of Operations Research<\/strong>, 2012.\n<ul class=\"wp-block-list\">\n<li><strong><mark class=\"has-inline-color has-vivid-red-color\">Featured in&nbsp;<em>Mathematics of Operations Research<\/em>&nbsp;50th Anniversary Editors\u2019 List of 50 Influential Papers, 2026<\/mark><\/strong><\/li>\n\n\n\n<li>Conference version appeared in&nbsp;<em>The 22nd ACM-SIAM Symposium on Discrete Algorithms (SODA)<\/em>, 2011<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Social Platforms\/Networks<\/strong><\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3385627\">Information Inundation on Platforms and Implications<\/a>, with G. Allon and K. Drakopoulos,&nbsp;<strong>Operations Research<\/strong>, 2020.\n<ul class=\"wp-block-list\">\n<li>Conference version appeared in&nbsp;<em>The 20th ACM Conference on Economics and Computation (EC)<\/em>, 2019<\/li>\n\n\n\n<li>Media: \u201c<a href=\"https:\/\/insights.som.yale.edu\/insights\/study-an-abundance-of-media-fuels-polarization\">An Abundance of Media Fuels Polarization.<\/a>\u201d Yale Insights<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3174391\">Diffusion in Random Networks: Impact of Degree Distribution<\/a>, with S. Misra and S. Rodilitz,&nbsp;<strong>Operations Research<\/strong>, 2019.\n<ul class=\"wp-block-list\">\n<li>Extended abstract appeared in&nbsp;<em>The 13th Workshop on the Economics Networks, Systems, and Computation (NetEcon)<\/em>, 2018<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/papers.ssrn.com\/sol3\/papers.cfm?abstract_id=3236225\">Impact of Network Structure on New Service Pricing<\/a>, with S. Alizamir, N. Chen, and S. Kim,&nbsp;<strong>Mathematics of Operations Research<\/strong>, 2021.<\/li>\n\n\n\n<li><a href=\"https:\/\/dl.acm.org\/citation.cfm?id=2090256\">Dynamics of prisoner\u2019s dilemma and the evolution of cooperation on networks<\/a>, with A. Saberi,&nbsp;<strong>Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS)<\/strong>, 2012.\n<ul class=\"wp-block-list\">\n<li>Extended abstract appeared in&nbsp;<em>The 6th Workshop on the Economics Networks, Systems, and Computation (NetEcon)<\/em>, 2011<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"http:\/\/ieeexplore.ieee.org\/document\/5394514\/\">Supermodular Network Games<\/a>, with R. Johari,&nbsp;<strong>The 47th Annual Allerton Conference on Communication, Control, and Computing<\/strong>, 2009.<\/li>\n<\/ul>\n\n\n\n<p class=\"wp-block-paragraph\"><\/p>\n\n\n\n<h2 class=\"wp-block-heading\"><strong>Other Topics<\/strong><\/h2>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/arxiv.org\/abs\/1703.04769\">The Stochastic Container Relocation Problem<\/a>, with V. Galle, S. Borjian Boroujeni, C. Barnhart, and P. Jaillet,&nbsp;<strong>Transportation Science<\/strong>, 2018.\n<ul class=\"wp-block-list\">\n<li>Algorithms and experimental results are available&nbsp;<a href=\"https:\/\/github.com\/vgalle\/StochasticCRP\">here<\/a><\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><a href=\"https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167637716300840\">An average-case asymptotic analysis of the Container Relocation Problem<\/a>, with V. Galle, S. Borjian Boroujeni, C. Barnhart, and P. Jaillet,&nbsp;<strong>Operations Research Letters<\/strong>, 2016.<\/li>\n\n\n\n<li><a href=\"https:\/\/arxiv.org\/abs\/1503.01535\">Managing Relocation and Delay in Container Terminals with Flexible Service Policies<\/a>, with S. Borjian Boroujeni, C. Barnhart, and P. Jaillet.<\/li>\n\n\n\n<li><a href=\"http:\/\/ieeexplore.ieee.org\/document\/6195828\/\">Distributed Node Placement Algorithms for Constructing Well-Connected Sensor Networks<\/a>, with A. J. Friend and A. Saberi,&nbsp;<strong>The 32nd IEEE International Conference on Computer Communications (INFOCOM)<\/strong>, 2012.<\/li>\n\n\n\n<li><a href=\"http:\/\/ieeexplore.ieee.org\/document\/4215889\/?arnumber=4215889\">Efficient, Fully Local Algorithms for CIOQ Switches<\/a>, with A. Firoozshahian, A. Goel, and B. Prabhakar,&nbsp;<strong>IEEE Conference on Computer Communications (INFOCOM)<\/strong>, 2007.<\/li>\n\n\n\n<li><a href=\"https:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/moor.1120.0551\">High-fidelity and Time-driven Simulation of Large Wireless Networks with Parallel Processing<\/a>, with H. Lee and D. C. Cox,&nbsp;<strong>IEEE Communications Magazine<\/strong>, 2009.<\/li>\n\n\n\n<li><a href=\"https:\/\/ieeexplore.ieee.org\/document\/4224837\">High-Fidelity Simulation of Mobile Cellular Systems with Integrated Resource Allocation and Adaptive Antennas<\/a>, with H. Lee, D. C. Cox, and N. K. Cheung,&nbsp;<strong>IEEE Wireless Communications and Networking Conference (WCNC)<\/strong>, 2007.<\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Platform\/Policy Design for Social Good Online\/Matching Platforms Social Platforms\/Networks Other Topics<\/p>\n","protected":false},"author":139,"featured_media":0,"parent":0,"menu_order":2,"comment_status":"closed","ping_status":"closed","template":"","meta":{"inline_featured_image":false,"_genesis_hide_title":false,"_genesis_hide_breadcrumbs":false,"_genesis_hide_singular_image":false,"_genesis_hide_footer_widgets":false,"_genesis_custom_body_class":"","_genesis_custom_post_class":"","_genesis_layout":"","footnotes":""},"class_list":["post-200","page","type-page","status-publish","entry"],"_links":{"self":[{"href":"https:\/\/faculty.som.yale.edu\/vahidehmanshadi\/wp-json\/wp\/v2\/pages\/200","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/faculty.som.yale.edu\/vahidehmanshadi\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/faculty.som.yale.edu\/vahidehmanshadi\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/faculty.som.yale.edu\/vahidehmanshadi\/wp-json\/wp\/v2\/users\/139"}],"replies":[{"embeddable":true,"href":"https:\/\/faculty.som.yale.edu\/vahidehmanshadi\/wp-json\/wp\/v2\/comments?post=200"}],"version-history":[{"count":11,"href":"https:\/\/faculty.som.yale.edu\/vahidehmanshadi\/wp-json\/wp\/v2\/pages\/200\/revisions"}],"predecessor-version":[{"id":249,"href":"https:\/\/faculty.som.yale.edu\/vahidehmanshadi\/wp-json\/wp\/v2\/pages\/200\/revisions\/249"}],"wp:attachment":[{"href":"https:\/\/faculty.som.yale.edu\/vahidehmanshadi\/wp-json\/wp\/v2\/media?parent=200"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}