Dynamic network congestion games

09/28/2020
by   Nathalie Bertrand, et al.
0

Congestion games are a classical type of games studied in game theory, in which n players choose a resource, and their individual cost increases with the number of other players choosing the same resource. In network congestion games (NCGs), the resources correspond to simple paths in a graph, e.g. representing routing options from a source to a target. In this paper, we introduce a variant of NCGs, referred to as dynamic NCGs: in this setting, players take transitions synchronously, they select their next transitions dynamically, and they are charged a cost that depends on the number of players simultaneously using the same transition. We study, from a complexity perspective, standard concepts of game theory in dynamic NCGs: social optima, Nash equilibria, and subgame perfect equilibria. Our contributions are the following: the existence of a strategy profile with social cost bounded by a constant is in PSPACE and NP-hard. (Pure) Nash equilibria always exist in dynamic NCGs; the existence of a Nash equilibrium with bounded cost can be decided in EXPSPACE, and computing a witnessing strategy profile can be done in doubly-exponential time. The existence of a subgame perfect equilibrium with bounded cost can be decided in 2EXPSPACE, and a witnessing strategy profile can be computed in triply-exponential time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/17/2020

Pure Nash Equilibria in Resource Graph Games

This paper studies the existence of pure Nash equilibria in resource gra...
research
07/04/2022

Non-Blind Strategies in Timed Network Congestion Games

Network congestion games are a convenient model for reasoning about rout...
research
03/15/2023

Nonatomic Non-Cooperative Neighbourhood Balancing Games

We introduce a game where players selfishly choose a resource and endure...
research
11/03/2020

On Singleton Congestion Games with Resilience Against Collusion

We study the subclass of singleton congestion games with identical and i...
research
11/25/2022

Strategic Facility Location with Clients that Minimize Total Waiting Time

We study a non-cooperative two-sided facility location game in which fac...
research
08/31/2020

Nash Social Distancing Games with Equity Constraints: How Inequality Aversion Affects the Spread of Epidemics

In this paper, we present a game-theoretic model describing the voluntar...
research
04/01/2022

Green Routing Game: Strategic Logistical Planning using Mixed Fleets of ICEVs and EVs

This paper introduces a "green" routing game between multiple logistic o...

Please sign up or login with your details

Forgot password? Click here to reset