45 citations · 204 across the 40 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
cs.DS2021★ 1 cited
Online Bipartite Matching with Reusable Resources
Steven Delong, Alireza Farhadi, Rad Niazadeh +2
We study the classic online bipartite matching problem with a twist: offline vertices, called resources, are . In particular, when a resource is matched to an on…
cs.LG2021
Online Learning via Offline Greedy Algorithms: Applications in Market Design and Optimization
Rad Niazadeh, Negin Golrezaei, Joshua Wang +2
Motivated by online decision-making in time-varying combinatorial environments, we study the problem of transforming offline algorithms to their online counterparts. We focus on of…
cs.GT2021
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 (…