no code implementations • 30 Oct 2024 • Kirk Bansak, Soonbong Lee, Vahideh Manshadi, Rad Niazadeh, Elisabeth Paulson
Motivated by our collaboration with a major refugee resettlement agency in the U. S., we study a dynamic matching problem where each new arrival (a refugee case) must be matched immediately and irrevocably to one of the static resources (a location with a fixed annual quota).
no code implementations • 21 Feb 2024 • Arpit Agarwal, Rad Niazadeh, Prathamesh Patil
Each user selects an item by first considering a prefix window of these ranked items and then picking the highest preferred item in that window (and the platform observes its payoff for this item).
no code implementations • 18 Feb 2021 • Rad Niazadeh, Negin Golrezaei, Joshua Wang, Fransisca Susan, Ashwinkumar Badanidiyuru
We leverage this notion to transform greedy robust offline algorithms into a $O(T^{2/3})$ (approximate) regret in the bandit setting.
no code implementations • 2 Feb 2021 • Vahideh Manshadi, Rad Niazadeh, Scott Rodilitz
For an arbitrarily correlated sequence of demands, we establish upper bounds on the expected minimum fill rate (ex-post fairness) and the minimum expected fill rate (ex-ante fairness) achievable by any policy.
Fairness
Computer Science and Game Theory
Data Structures and Algorithms
no code implementations • 7 Aug 2018 • Moses Charikar, Vaggos Chatziafratis, Rad Niazadeh
Hierarchical Clustering (HC) is a widely studied problem in exploratory data analysis, usually tackled by simple agglomerative procedures like average-linkage, single-linkage or complete-linkage.
no code implementations • NeurIPS 2018 • Rad Niazadeh, Tim Roughgarden, Joshua R. Wang
Our main result is the first $\frac{1}{2}$-approximation algorithm for continuous submodular function maximization; this approximation factor of $\frac{1}{2}$ is the best possible for algorithms that only query the objective function at polynomially many points.
no code implementations • ICML 2018 • Vaggos Chatziafratis, Rad Niazadeh, Moses Charikar
For many real-world applications, we would like to exploit prior information about the data that imposes constraints on the clustering hierarchy, and is not captured by the set of features available to the algorithm.
no code implementations • 26 May 2017 • Sébastien Bubeck, Nikhil R. Devanur, Zhiyi Huang, Rad Niazadeh
For the online posted pricing problem, we show regret bounds that scale with the best fixed price, rather than the range of the values.
no code implementations • 1 Mar 2017 • Shuchi Chawla, Nikhil Devanur, Janardhan Kulkarni, Rad Niazadeh
The service provider's goal is to implement a truthful online mechanism for scheduling jobs so as to maximize the social welfare of the schedule.
no code implementations • 13 Jun 2010 • Rad Niazadeh, Masoud Babaie-Zadeh, Christian Jutten
Recently, it has been proved in Babadi et al. that in noisy compressed sensing, a joint typical estimator can asymptotically achieve the Cramer-Rao lower bound of the problem. To prove this result, this paper used a lemma, which is provided in Akcakaya et al, that comprises the main building block of the proof.