The second is a Sample Average Approximation (SAA) based algorithm, which we analyze for the Chung-Lu random graph model.
In response to COVID-19, many countries have mandated social distancing and banned large group gatherings in order to slow down the spread of SARS-CoV-2.
In the most general form, the platform consists of three entities: two sides to be matched and a platform operator that decides the matching.
Restless and collapsing bandits are often used to model budget-constrained resource allocation in settings where arms have action-dependent transition probabilities, such as the allocation of health interventions among patients.
We derive fundamental lower bounds on the approximation of the utilitarian and egalitarian objectives and introduce algorithms with provable guarantees for them.
Clustering is a fundamental problem in unsupervised machine learning, and fair variants of it have recently received significant attention due to its societal implications.
Graph cut problems are fundamental in Combinatorial Optimization, and are a central object of study in both theory and practice.
Metric clustering is fundamental in areas ranging from Combinatorial Optimization and Data Mining, to Machine Learning and Operations Research.
The main focus of this paper is radius-based (supplier) clustering in the two-stage stochastic setting with recourse, where the inherent stochasticity of the model comes in the form of a budget constraint.
Data Structures and Algorithms
Clustering is a foundational problem in machine learning with numerous applications.
Moreover, if in such a scenario, the assignment of requests to drivers (by the platform) is made only to maximize profit and/or minimize wait time for riders, requests of a certain type (e. g. from a non-popular pickup location, or to a non-popular drop-off location) might never be assigned to a driver.
Rideshare platforms such as Uber and Lyft dynamically dispatch drivers to match riders' requests.
On the upper bound side, we show that this framework, combined with a black-box adapted from Bansal et al., (Algorithmica, 2012), yields an online algorithm which nearly doubles the ratio to 0. 46.
Prior work addresses online bipartite matching markets, where agents arrive over time and are dynamically matched to a known set of disposable resources.