Equity Promotion in Public Transportation

• URL: http://arxiv.org/abs/2211.14531v1
• Date: Sat, 26 Nov 2022 10:06:00 GMT
• Title: Equity Promotion in Public Transportation
• Authors: Anik Pramanik, Pan Xu and Yifan Xu
• Abstract summary: We propose an optimization model to study how to integrate the two approaches together for equity-promotion purposes. We have designed a linear-programming (LP) based rounding algorithm, which proves to achieve an optimal approximation ratio of 1-1/e. Experimental results confirm our theoretical predictions and demonstrate the effectiveness of our LP-based strategy in promoting social equity.
• Score: 18.057286025603055
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: There are many news articles reporting the obstacles confronting poverty-stricken households in access to public transits. These barriers create a great deal of inconveniences for these impoverished families and more importantly, they contribute a lot of social inequalities. A typical approach addressing the issue is to build more transport infrastructure to offer more opportunities to access the public transits especially for those deprived communities. Examples include adding more bus lines connecting needy residents to railways systems and extending existing bus lines to areas with low socioeconomic status. Recently, a new strategy is proposed, which is to harness the ubiquitous ride-hailing services to connect disadvantaged households with the nearest public transportations. Compared with the former infrastructure-based solution, the ride-hailing-based strategy enjoys a few exclusive benefits such as higher effectiveness and more flexibility. In this paper, we propose an optimization model to study how to integrate the two approaches together for equity-promotion purposes. Specifically, we aim to design a strategy of allocating a given limited budget to different candidate programs such that the overall social equity is maximized, which is defined as the minimum covering ratio among all pre-specified protected groups of households (based on race, income, etc.). We have designed a linear-programming (LP) based rounding algorithm, which proves to achieve an optimal approximation ratio of 1-1/e. Additionally, we test our algorithm against a few baselines on real data assembled by outsourcing multiple public datasets collected in the city of Chicago. Experimental results confirm our theoretical predictions and demonstrate the effectiveness of our LP-based strategy in promoting social equity, especially when the budget is insufficient.

Related papers

• Enhancing Accessibility of Rural Populations through Vehicle-based Services [0.9217021281095907]
  Mobile clinics offer a cost-effective solution to enhance spatial accessibility for the rural population. Our integrated approach utilizes GIS data and an accessibility scaling factor to assess spatial accessibility for rural populations. This approach aids decision-makers, including fleet operators, policymakers, and public authorities in Sub-Saharan Africa, during project evaluation and planning for mobile facilities.
  arXiv  Detail & Related papers  (2024-02-02T09:28:17Z)
• AccEq-DRT: Planning Demand-Responsive Transit to reduce inequality of accessibility [7.615022055373833]
  We focus on accessibility provided by Public Transit (PT) There is an evident inequality in the distribution of accessibility between city centers or close to main transportation corridors and suburbs. We propose a DRT planning strategy, which we call AccEq-DRT, aimed at reducing accessibility inequality.
  arXiv  Detail & Related papers  (2023-10-06T16:13:28Z)
• Nash Welfare and Facility Location [82.81742334337336]
  We consider the problem of locating a facility to serve a set of agents located along a line. The Nash welfare objective function, defined as the product of the agents' utilities, is known to provide a compromise between fairness and efficiency.
  arXiv  Detail & Related papers  (2023-10-06T09:06:44Z)
• Safe Model-Based Multi-Agent Mean-Field Reinforcement Learning [48.667697255912614]
  Mean-field reinforcement learning addresses the policy of a representative agent interacting with the infinite population of identical agents. We propose Safe-M$3$-UCRL, the first model-based mean-field reinforcement learning algorithm that attains safe policies even in the case of unknown transitions. Our algorithm effectively meets the demand in critical areas while ensuring service accessibility in regions with low demand.
  arXiv  Detail & Related papers  (2023-06-29T15:57:07Z)
• Social Diversity Reduces the Complexity and Cost of Fostering Fairness [63.70639083665108]
  We investigate the effects of interference mechanisms which assume incomplete information and flexible standards of fairness. We quantify the role of diversity and show how it reduces the need for information gathering. Our results indicate that diversity changes and opens up novel mechanisms available to institutions wishing to promote fairness.
  arXiv  Detail & Related papers  (2022-11-18T21:58:35Z)
• Equity Scores for Public Transit Lines from Open-Data and Accessibility Measures [0.3058685580689604]
  Current transit suffers from an evident inequity: the level of service of transit in suburbs is much less satisfying than in city centers. To achieve sustainability goals and reduce car-dependency, transit should be (re)designed around equity.
  arXiv  Detail & Related papers  (2022-09-30T22:58:11Z)
• Prioritizing municipal lead mitigation projects as a relaxed knapsack optimization: a method and case study [0.0]
  This paper describes a simple process for estimating child health impact at a parcel level by cleaning and synthesizing municipal datasets. Using geocoding as the core record linkage mechanism, parcel-level toxicity data can be combined with school enrollment records. A harm metric of estimated exposure-years is described at the parcel level, which can then be aggregated to the project level and minimized globally.
  arXiv  Detail & Related papers  (2022-01-23T21:42:10Z)
• Efficiency, Fairness, and Stability in Non-Commercial Peer-to-Peer Ridesharing [84.47891614815325]
  This paper focuses on the core problem in P2P ridesharing: the matching of riders and drivers. We introduce novel notions of fairness and stability in P2P ridesharing. Results suggest that fair and stable solutions can be obtained in reasonable computational times.
  arXiv  Detail & Related papers  (2021-10-04T02:14:49Z)
• GAEA: Graph Augmentation for Equitable Access via Reinforcement Learning [50.90625274621288]
  Disparate access to resources by different subpopulations is a prevalent issue in societal and sociotechnical networks. We introduce a new class of problems, Graph Augmentation for Equitable Access (GAEA), to enhance equity in networked systems by editing graph edges under budget constraints.
  arXiv  Detail & Related papers  (2020-12-07T18:29:32Z)
• Real-time and Large-scale Fleet Allocation of Autonomous Taxis: A Case Study in New York Manhattan Island [14.501650948647324]
  Traditional models fail to efficiently allocate the available fleet to deal with the imbalance of supply (autonomous taxis) and demand (trips) We employ a Constrained Multi-agent Markov Decision Processes (CMMDP) to model fleet allocation decisions. We also leverage a Column Generation algorithm to guarantee the efficiency and optimality in a large scale.
  arXiv  Detail & Related papers  (2020-09-06T16:00:15Z)
• Local Differential Privacy based Federated Learning for Internet of Things [72.83684013377433]
  Internet of Vehicles (IoV) simulates a large variety of crowdsourcing applications such as Waze, Uber, and Amazon Mechanical Turk, etc. Users of these applications report the real-time traffic information to the cloud server which trains a machine learning model based on traffic information reported by users for intelligent traffic management. In this paper, we propose to integrate federated learning and local differential privacy (LDP) to facilitate the crowdsourcing applications to achieve the machine learning model.
  arXiv  Detail & Related papers  (2020-04-19T14:03:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.