Modeling and Analysis of Heterogeneous Traffic Networks with Anarchists and Socialist Traffic

Abstract

In this paper, we consider a heterogeneous traffic network with multiple users classes which differ considerably in their path selection objective. In particular, we consider two classes of users: ones who seek to minimize social cost (socialists) and the ones with typical greedy objective (anarchists) which leads to a heterogeneous game termed as HetGame. The paper proposes an analytical framework to derive optimal/equilibrium flow in such a heterogeneous game along with a method for the same. The paper considers multiple examples of different networks to derive the optimal traffic assignment. We introduce two metrics: price of α anarchy and price of good behavior to evaluate the impact of anarchists and implications of central directives. Finally, the proposed algorithm is implemented for a real traffic network to derive insights.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…