Abstract: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 the income inequality among rideshare drivers due to discriminative cancellations from riders, and the tradeoff between the income inequality (called fairness objective) with the system efficiency (called profit objective). We proposed an online bipartite-matching model where riders are assumed to arrive sequentially follow… Show more
“…Nanda et al [36] proposed a bi-objective online-matching-based model to study the tradeoff between the system efficiency (profit) and the fairness among rideshare riders during high-demand hours. In contrast, Xu and Xu [37] presented a similar model to examine the tradeoff between the system efficiency and the income equality among rideshare drivers. Unlike focusing on one single objective of fairness maximization like here, both studies in [36] and [37] seek to balance the objective of fairness maximization with that of profit maximization.…”
Section: Other Related Workmentioning
confidence: 99%
“…In contrast, Xu and Xu [37] presented a similar model to examine the tradeoff between the system efficiency and the income equality among rideshare drivers. Unlike focusing on one single objective of fairness maximization like here, both studies in [36] and [37] seek to balance the objective of fairness maximization with that of profit maximization. Recently, Ma et al [38] considered a similar problem to us but focus on the fairness among online agents.…”
Section: Other Related Workmentioning
confidence: 99%
“…We test our algorithms of IFM and GFM on a public ridehailing dataset, which is collected from the city of Chicago 10 . Following the setting in [36,37], we focus on a short time window and assume that drivers are offline agents while riders are online agents that arrive dynamically. Our goal is to maximize individual and group fairness among all drivers.…”
Matching markets involve heterogeneous agents (typically from two parties) who are paired for mutual benefit. During the last decade, matching markets have emerged and grown rapidly through the medium of the Internet. They have evolved into a new format, called Online Matching Markets (OMMs), with examples ranging from crowdsourcing to online recommendations to ridesharing. There are two features distinguishing OMMs from traditional matching markets. One is the dynamic arrival of one side of the market: we refer to these as online agents while the rest are offline agents. Examples of online and offline agents include keywords (online) and sponsors (offline) in Google Advertising; workers (online) and tasks (offline) in Amazon Mechanical Turk (AMT); riders (online) and drivers (offline when restricted to a short time window) in ridesharing. The second distinguishing feature of OMMs is the real-time decision-making element. However, studies have shown that the algorithms making decisions in these OMMs leave disparities in the match rates of offline agents. For example, tasks in neighborhoods of low socioeconomic status rarely get matched to gig workers, and drivers of certain races/genders get discriminated against in matchmaking. In this paper, we propose online matching algorithms which optimize for either individual or group-level fairness among offline agents in OMMs. We present two linear-programming (LP) based sampling algorithms, which achieve online competitive ratios at least 0.725 for individual fairness maximization (IFM) and 0.719 for group fairness maximization (GFM), respectively. There are two key ideas helping us break the barrier of 1 − 1/e. One is boosting, which is to adaptively re-distribute all sampling probabilities only among those offline available neighbors for every arriving online agent. The other is attenuation, which aims to balance the matching probabilities among offline agents with different mass allocated by the benchmark LP. We conduct extensive numerical experiments and results show that our boosted version of sampling algorithms are not only conceptually easy to implement but also highly effective in practical instances of fairness-maximization-related models.
“…Nanda et al [36] proposed a bi-objective online-matching-based model to study the tradeoff between the system efficiency (profit) and the fairness among rideshare riders during high-demand hours. In contrast, Xu and Xu [37] presented a similar model to examine the tradeoff between the system efficiency and the income equality among rideshare drivers. Unlike focusing on one single objective of fairness maximization like here, both studies in [36] and [37] seek to balance the objective of fairness maximization with that of profit maximization.…”
Section: Other Related Workmentioning
confidence: 99%
“…In contrast, Xu and Xu [37] presented a similar model to examine the tradeoff between the system efficiency and the income equality among rideshare drivers. Unlike focusing on one single objective of fairness maximization like here, both studies in [36] and [37] seek to balance the objective of fairness maximization with that of profit maximization. Recently, Ma et al [38] considered a similar problem to us but focus on the fairness among online agents.…”
Section: Other Related Workmentioning
confidence: 99%
“…We test our algorithms of IFM and GFM on a public ridehailing dataset, which is collected from the city of Chicago 10 . Following the setting in [36,37], we focus on a short time window and assume that drivers are offline agents while riders are online agents that arrive dynamically. Our goal is to maximize individual and group fairness among all drivers.…”
Matching markets involve heterogeneous agents (typically from two parties) who are paired for mutual benefit. During the last decade, matching markets have emerged and grown rapidly through the medium of the Internet. They have evolved into a new format, called Online Matching Markets (OMMs), with examples ranging from crowdsourcing to online recommendations to ridesharing. There are two features distinguishing OMMs from traditional matching markets. One is the dynamic arrival of one side of the market: we refer to these as online agents while the rest are offline agents. Examples of online and offline agents include keywords (online) and sponsors (offline) in Google Advertising; workers (online) and tasks (offline) in Amazon Mechanical Turk (AMT); riders (online) and drivers (offline when restricted to a short time window) in ridesharing. The second distinguishing feature of OMMs is the real-time decision-making element. However, studies have shown that the algorithms making decisions in these OMMs leave disparities in the match rates of offline agents. For example, tasks in neighborhoods of low socioeconomic status rarely get matched to gig workers, and drivers of certain races/genders get discriminated against in matchmaking. In this paper, we propose online matching algorithms which optimize for either individual or group-level fairness among offline agents in OMMs. We present two linear-programming (LP) based sampling algorithms, which achieve online competitive ratios at least 0.725 for individual fairness maximization (IFM) and 0.719 for group fairness maximization (GFM), respectively. There are two key ideas helping us break the barrier of 1 − 1/e. One is boosting, which is to adaptively re-distribute all sampling probabilities only among those offline available neighbors for every arriving online agent. The other is attenuation, which aims to balance the matching probabilities among offline agents with different mass allocated by the benchmark LP. We conduct extensive numerical experiments and results show that our boosted version of sampling algorithms are not only conceptually easy to implement but also highly effective in practical instances of fairness-maximization-related models.
“…Justification of parameters {𝜇 𝑔 }. Observe that previous studies (Ma, Xu, and Xu 2020;Nanda et al 2020;Xu and Xu 2020) have chosen a fairness metric as min 𝑔 ∈ G E[𝑋 𝑔 ]/E[ 𝐴 𝑔 ], the minimum ratio of the expected number of agents served to that of arrivals among all groups. This can be cast as a special case of ASR by setting each…”
Section: Equity Metricsmentioning
confidence: 99%
“…One technical challenge in addressing (internal) equity promotion in online resource allocation is how to craft a proper metric of equity. Current metrics of equity proposed so far are all based on the minimum ratio of the number of requesters served to that of total arrivals within any given group (Ma, Xu, and Xu 2020;Nanda et al 2020;Xu and Xu 2020). Unfortunately, these metrics fail to capture the exact equity we expect in practice.…”
We consider online resource allocation under a typical nonprofit setting, where limited or even scarce resources are administered by a not-for-profit organization like a government. We focus on the internal-equity by assuming that arriving requesters are homogeneous in terms of their external factors like demands but heterogeneous for their internal attributes like demographics. Specifically, we associate each arriving requester with one or several groups based on their demographics (i.e., race, gender, and age), and we aim to design an equitable distributing strategy such that every group of requesters can receive a fair share of resources proportional to a preset target ratio. We present two LP-based sampling algorithms and investigate them both theoretically (in terms of competitive-ratio analysis) and experimentally based on real COVID-19 vaccination data maintained by the Minnesota Department of Health. Both theoretical and numerical results show that our LP-based sampling strategies can effectively promote equity, especially when the arrival population is disproportionately represented, as observed in the early stage of the COVID-19 vaccine rollout.
We study the optimization of large-scale, real-time ridesharing systems and propose a modular design methodology, Component Algorithms for Ridesharing (CAR). We evaluate a diverse set of CARs (14 in total), focusing on the key algorithmic components of ridesharing. We take a multi-objective approach, evaluating 10 metrics related to global efficiency, complexity, passenger, and platform incentives, in settings designed to closely resemble reality in every aspect, focusing on vehicles of capacity two. To the best of our knowledge, this is the largest and most comprehensive evaluation to date. We (i) identify CARs that perform well on global, passenger, or platform metrics, (ii) demonstrate that lightweight relocation schemes can significantly improve the Quality of Service by up to $$50\%$$
50
%
, and (iii) highlight a practical, scalable, on-device CAR that works well across all metrics.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.