DeepAI AI Chat
Log In Sign Up

Nash equilibria in routing games with edge priorities

by   Robert Scheffler, et al.
BTU Cottbus-Senftenberg
RWTH Aachen University

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 want to enter an edge at the same time exceeds the inflow capacity of this edge, edge priorities with respect to the preceding edge solve these conflicts. Our edge priorities are well-motivated by applications in traffic. For this class of games, we show the existence of equilibrium solutions for single-source-single-sink games and we analyze structural properties of these solutions. We present an algorithm that computes Nash equilibria and we prove bounds both on the Price of Stability and on the Price of Anarchy. Moreover, we introduce the new concept of a Price of Mistrust. Finally, we also study the relations to earliest arrival flows.


page 1

page 2

page 3

page 4


The Quality of Equilibria for Set Packing Games

We introduce set packing games as an abstraction of situations in which ...

Topological Price of Anarchy Bounds for Clustering Games on Networks

We consider clustering games in which the players are embedded in a netw...

Convergence of a Packet Routing Model to Flows Over Time

The mathematical approaches for modeling dynamic traffic can roughly be ...

Tight Bounds for the Price of Anarchy and Stability in Sequential Transportation Games

In this paper, we analyze a transportation game first introduced by Fota...

Routing Games over Time with FIFO policy

We study atomic routing games where every agent travels both along its d...

Routing Games in the Wild: Efficiency, Equilibration and Regret (Large-Scale Field Experiments in Singapore)

Routing games are amongst the most well studied domains of game theory. ...

Fair Tree Connection Games with Topology-Dependent Edge Cost

How do rational agents self-organize when trying to connect to a common ...