Allocation problems in ride-sharing platforms: Online matching with offline reusable resources
JP Dickerson, KA Sankararaman… - ACM Transactions on …, 2021 - dl.acm.org
Bipartite-matching markets pair agents on one side of a market with agents, items, or
contracts on the opposing side. Prior work addresses online bipartite-matching markets …
contracts on the opposing side. Prior work addresses online bipartite-matching markets …
Balancing the tradeoff between profit and fairness in rideshare platforms during high-demand hours
Rideshare platforms, when assigning requests to drivers, tend to maximize profit for the
system and/or minimize waiting time for riders. Such platforms can exacerbate biases that …
system and/or minimize waiting time for riders. Such platforms can exacerbate biases that …
Edge-weighted online bipartite matching
Online bipartite matching is one of the most fundamental problems in the online algorithms
literature. Karp, Vazirani, and Vazirani (STOC 1990) gave an elegant algorithm for …
literature. Karp, Vazirani, and Vazirani (STOC 1990) gave an elegant algorithm for …
Improved online contention resolution for matchings and applications to the gig economy
Background. Our results tie into the literature on contention resolution schemes [3], which we
briefly define. Let P (𝐺) denote the fractional matching polytope of a graph 𝐺=(𝑉, 𝐸). In a …
briefly define. Let P (𝐺) denote the fractional matching polytope of a graph 𝐺=(𝑉, 𝐸). In a …
Fairness maximization among offline agents in online-matching markets
Online matching markets (OMMs) are commonly used in today's world to pair agents from
two parties (whom we will call offline and online agents) for mutual benefit. However, studies …
two parties (whom we will call offline and online agents) for mutual benefit. However, studies …
Trading the system efficiency for the income equality of drivers in rideshare
Several scientific studies have reported the existence of the income gap among rideshare
drivers based on demographic factors such as gender, age, race, etc. In this paper, we study …
drivers based on demographic factors such as gender, age, race, etc. In this paper, we study …
Improved guarantees for offline stochastic matching via new ordered contention resolution schemes
Matching is one of the most fundamental and broadly applicable problems across many
domains. In these diverse real-world applications, there is often a degree of uncertainty in …
domains. In these diverse real-world applications, there is often a degree of uncertainty in …
Multi-stage and multi-customer assortment optimization with inventory constraints
E Fata, W Ma, D Simchi-Levi - arxiv preprint arxiv:1908.09808, 2019 - arxiv.org
We consider an assortment optimization problem where a customer chooses a single item
from a sequence of sets shown to her, while limited inventories constrain the items offered to …
from a sequence of sets shown to her, while limited inventories constrain the items offered to …
Random-order contention resolution via continuous induction: Tightness for bipartite matching under vertex arrivals
We introduce a new approach for designing Random-order Contention Resolution Schemes
(RCRS's) via exact solution in continuous time. Given a function c (y):[0, 1]→[0, 1], we show …
(RCRS's) via exact solution in continuous time. Given a function c (y):[0, 1]→[0, 1], we show …
Online matching with delays and stochastic arrival times
Consider a platform where independent agents arrive at random times and need to be
matched into pairs, eventually after waiting for some time. This, for example, models job …
matched into pairs, eventually after waiting for some time. This, for example, models job …