26 citations · 67 across the 12 of their papers we have counts for
14 papers
Designing Approximately Optimal Search on Matching Platforms
Nicole Immorlica, Brendan Lucier, Vahideh Manshadi +1
We study the design of a decentralized two-sided matching market in which agents' search is guided by the platform. There are finitely many agent types, each with (potentially rand…
Fair Dynamic Rationing
Vahideh Manshadi, Rad Niazadeh, Scott Rodilitz
We study the allocative challenges that governmental and nonprofit organizations face when tasked with equitable and efficient rationing of a social good among agents whose needs (…
Commitment on Volunteer Crowdsourcing Platforms: Implications for Growth and Engagement
Irene Lo, Vahideh Manshadi, Scott Rodilitz +1
Volunteer crowdsourcing platforms match volunteers with tasks which are often recurring. To ensure completion of such tasks, platforms frequently use a lever known as "adoption," w…
Information Design for Congested Social Services: Optimal Need-Based Persuasion
Jerry Anunrojwong, Krishnamurthy Iyer, Vahideh Manshadi
We study the effectiveness of information design in reducing congestion in social services catering to users with varied levels of need. In the absence of price discrimination and…
Online Policies for Efficient Volunteer Crowdsourcing
Vahideh Manshadi, Scott Rodilitz
Nonprofit crowdsourcing platforms such as food recovery organizations rely on volunteers to perform time-sensitive tasks. To encourage volunteers to complete a task, platforms use…
Online Resource Allocation under Partially Predictable Demand
Dawsen Hwang, Patrick Jaillet, Vahideh Manshadi
For online resource allocation problems, we propose a new demand arrival model where the sequence of arrivals contains both an adversarial component and a stochastic one. Our model…
The Stochastic Container Relocation Problem
Virgile Galle, Setareh Borjian Boroujeni, Vahideh H. Manshadi +2
The Container Relocation Problem (CRP) is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers, while…
A Generalized Bass Model for Product Growth in Networks
Vahideh H. Manshadi, Sidhant Misra
Many products and innovations become well-known and widely adopted through the social interactions of individuals in a population. The Bass diffusion model has been widely used to…
On Matching and Thickness in Heterogeneous Dynamic Markets
Itai Ashlagi, Maximillien Burq, Patrick Jaillet +1
We study dynamic matching in an infinite-horizon stochastic market. While all agents are potentially compatible with each other, some are hard-to-match and others are easy-to-match…
Container Relocation Problem: Approximation, Asymptotic, and Incomplete Information
Setareh Borjian, Virgile Galle, Vahideh H. Manshadi +2
The Container Relocation Problem (CRP) is concerned with finding a sequence of moves of containers that minimizes the number of relocations needed to retrieve all containers respec…
Managing Relocation and Delay in Container Terminals with Flexible Service Policies
Setareh Borjian, Vahideh H. Manshadi, Cynthia Barnhart +1
We introduce a new model and mathematical formulation for planning crane moves in the storage yard of container terminals. Our objective is to develop a tool that captures customer…
Kidney Exchange in Dynamic Sparse Heterogenous Pools
Itai Ashlagi, Patrick Jaillet, Vahideh H. Manshadi
Current kidney exchange pools are of moderate size and thin, as they consist of many highly sensitized patients. Creating a thicker pool can be done by waiting for many pairs to ar…
Prisoner's Dilemma on Graphs with Large Girth
Vahideh H. Manshadi, Amin Saberi
We study the evolution of cooperation in populations where individuals play prisoner's dilemma on a network. Every node of the network corresponds on an individual choosing whether…
Online Stochastic Matching: Online Actions Based on Offline Statistics
Vahideh H. Manshadi, Shayan Oveis Gharan, Amin Saberi
We consider the online stochastic matching problem proposed by Feldman et al. [FMMM09] as a model of display ad allocation. We are given a bipartite graph; one side of the graph co…