4 papers
Do Preferences Matter in Balanced Task Allocation?
Terence Highsmith
I model balanced task allocation where tasks stochastically arrive and must be matched to a fixed set of agents; the novel constraint is that agents must receive allocations that r…
How to Use Prices for Efficient Online Matching
Terence Highsmith
Many matching markets feature unknown, dynamic arrivals of agents that must match immediately. A caseworker must match an abused child to a foster home, a hospital must assign a pa…
A Dynamic Matching Framework for Faster Child Adoptions
Terence Highsmith
Caseworkers in foster care systems match waiting children to adoptive homes. We use dynamic matching market design to characterize a class of mechanisms that incentivize expedient…
Matching Design with Algorithms and Applications to Foster Care
Terence Highsmith
We study the problem of an organization that matches agents to objects where agents have preference rankings over objects and the organization uses algorithms to construct a rankin…