IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v59y2025i2p340-359.html
   My bibliography  Save this article

CARMA: Fair and Efficient Bottleneck Congestion Management via Nontradable Karma Credits

Author

Listed:
  • Ezzat Elokda

    (Automatic Control Laboratory, Department of Information Technology and Electric Engineering, ETH Zürich (Eidgenössische Technische Hochschule Zürich), 8092 Zürich, Switzerland; and Institute for Dynamic Systems and Control, Department of Mechanical and Process Engineering, ETH Zürich (Eidgenössische Technische Hochschule Zürich), 8092 Zürich, Switzerland)

  • Carlo Cenedese

    (Automatic Control Laboratory, Department of Information Technology and Electric Engineering, ETH Zürich (Eidgenössische Technische Hochschule Zürich), 8092 Zürich, Switzerland)

  • Kenan Zhang

    (Automatic Control Laboratory, Department of Information Technology and Electric Engineering, ETH Zürich (Eidgenössische Technische Hochschule Zürich), 8092 Zürich, Switzerland; and Laboratory for Human-Oriented Mobility Eco-system School of Architecture, Civil and Environmental Engineering, EPFL (École Polytechnique fédérale de Lausanne), 1015 Lausanne, Switzerland)

  • Andrea Censi

    (Institute for Dynamic Systems and Control, Department of Mechanical and Process Engineering, ETH Zürich (Eidgenössische Technische Hochschule Zürich), 8092 Zürich, Switzerland)

  • John Lygeros

    (Automatic Control Laboratory, Department of Information Technology and Electric Engineering, ETH Zürich (Eidgenössische Technische Hochschule Zürich), 8092 Zürich, Switzerland)

  • Emilio Frazzoli

    (Institute for Dynamic Systems and Control, Department of Mechanical and Process Engineering, ETH Zürich (Eidgenössische Technische Hochschule Zürich), 8092 Zürich, Switzerland)

  • Florian Dörfler

    (Automatic Control Laboratory, Department of Information Technology and Electric Engineering, ETH Zürich (Eidgenössische Technische Hochschule Zürich), 8092 Zürich, Switzerland)

Abstract

This paper proposes a nonmonetary traffic demand management scheme, named CARMA , as a fair solution to the morning commute congestion. We consider heterogeneous commuters traveling through a single bottleneck that differ in both the desired arrival time and value of time (VOT). We consider a generalized notion of VOT by allowing it to vary dynamically on each day (e.g., according to trip purpose and urgency) rather than being a static characteristic of each individual. In our CARMA scheme, the bottleneck is divided into a fast lane that is kept in free flow and a slow lane that is subject to congestion. We introduce a nontradable mobility credit, named karma , that is used by commuters to bid for access to the fast lane. Commuters who get outbid or do not participate in the CARMA scheme instead use the slow lane. At the end of each day, karma collected from the bidders is redistributed, and the process repeats day by day. We model the collective commuter behaviors under CARMA as a dynamic population game (DPG), in which a stationary Nash equilibrium (SNE) is guaranteed to exist. Unlike existing monetary schemes, CARMA is demonstrated, both analytically and numerically, to achieve (a) an equitable traffic assignment with respect to heterogeneous income classes and (b) a strong Pareto improvement in the long-term average travel disutility with respect to no policy intervention. With extensive numerical analysis, we show that CARMA is able to retain the same congestion reduction as an optimal monetary tolling scheme under uniform karma redistribution and even outperform tolling under a well-designed redistribution scheme. We also highlight the privacy-preserving feature of CARMA , that is, its ability to tailor to the private preferences of commuters without centrally collecting the information.

Suggested Citation

  • Ezzat Elokda & Carlo Cenedese & Kenan Zhang & Andrea Censi & John Lygeros & Emilio Frazzoli & Florian Dörfler, 2025. "CARMA: Fair and Efficient Bottleneck Congestion Management via Nontradable Karma Credits," Transportation Science, INFORMS, vol. 59(2), pages 340-359, March.
  • Handle: RePEc:inm:ortrsc:v:59:y:2025:i:2:p:340-359
    DOI: 10.1287/trsc.2023.0323
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2023.0323
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2023.0323?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:59:y:2025:i:2:p:340-359. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.