Related papers: Reconciling Selfish Routing with Social Good

In routing games, the network performance at equilibrium can be significantly improved if we remove some edges from the network. This counterintuitive fact, widely known as Braess's paradox, gives rise to the (selfish) network design…

When multiple users share a common link in direct transmission, packet loss and network collision may occur due to the simultaneous arrival of traffics at the source node. To tackle this problem, users may resort to an indirect path: the…

We study {\em bottleneck routing games} where the social cost is determined by the worst congestion on any edge in the network. In the literature, bottleneck games assume player utility costs determined by the worst congested edge in their…

In this paper, we study a routing and travel-mode choice problem for mobility systems with a multimodal transportation network as a ``mobility game" with coupled action sets. We develop a game-theoretic framework to study the impact on…

Network congestion games are a convenient model for reasoning about routing problems in a network: agents have to move from a source to a target vertex while avoiding congestion, measured as a cost depending on the number of players using…

Flow scheduling tends to be one of the oldest and most stubborn problems in networking. It becomes more crucial in the next generation network, due to fast changing link states and tremendous cost to explore the global structure. In such…

Congestion games are popular models often used to study the system-level inefficiencies caused by selfish agents, typically measured by the price of anarchy. One may expect that aligning the agents' preferences with the system-level…

This paper is concerned with a conservation law model of traffic flow on a network of roads, where each driver chooses his own departure time in order to minimize the sum of a departure cost and an arrival cost. The model includes various…

This paper examines the behavior of the price of anarchy as a function of the traffic inflow in nonatomic congestion games with multiple origin-destination (O/D) pairs. Empirical studies in real-world networks show that the price of anarchy…

In this work we propose a macroscopic model for studying routing on networks shared between human-driven and autonomous vehicles that captures the effects of autonomous vehicles forming platoons. We use this to study inefficiency due to…

The decisions that human beings make to allocate time has significant bearing on economic output and to the sustenance of social networks. The time allocation problem motivates our formal analysis of the resource allocation game, where…

We study a routing game in which one of the players unilaterally acts altruistically by taking into consideration the latency cost of other players as well as his own. By not playing selfishly, a player can not only improve the other…

We study the traffic routing game among a large number of selfish drivers over a traffic network. We consider a specific scenario where the strategic drivers can be classified into teams, where drivers in the same team have identical payoff…

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…

Today mobile users are intensively interconnected thanks to the emerging mobile social networks, where they share location-based information with each other when traveling on different routes and visit different areas of the city. In our…

In this paper we present a new competitive packet routing model with edge priorities. We consider players that route selfishly through a network over time and try to reach their destinations as fast as possible. If the number of players who…

Predicting selfish behavior in public environments by considering Nash equilibria is a central concept of game theory. For the dynamic traffic assignment problem modeled by a flow over time game, in which every particle tries to reach its…

This paper focuses on two commonly used path assignment policies for agents traversing a congested network: self-interested routing, and system-optimum routing. In the self-interested routing policy each agent selects a path that optimizes…

We propose average unfairness as a new measure of fairness in routing games, defined as the ratio between the average latency and the minimum latency experienced by users. This measure is a natural complement to two existing unfairness…

We introduce a unifying model to study the impact of worst-case latency deviations in non-atomic selfish routing games. In our model, latencies are subject to (bounded) deviations which are taken into account by the players. The quality…