Density Flow over Networks: A Mean-field Game Theoretic Approach

Dario Bauso, Xuan Zhang, Antonis Papachristodoulou

Risultato della ricerca: Other

3 Citazioni (Scopus)

Abstract

A distributed routing control algorithm for dynamicnetworks has recently been presented in the literature.The networks were modeled using time evolution of densityat network edges and the routing control algorithm allowededge density to converge to a Wardrop equilibrium, which wascharacterized by an equal traffic density on all used paths.We borrow the idea and rearrange the density model to recastthe problem within the framework of mean-field games. Thecontribution of this paper is three-fold. First, we provide amean-field game formulation of the problem at hand. Second,we illustrate an extended state space solution approach. Third,we study the stochastic case where the density evolution isdriven by a Brownian motion.
Lingua originaleEnglish
Pagine3469-3474
Numero di pagine6
Stato di pubblicazionePublished - 2014

Fingerprint

Mean Field
Game
Brownian movement
Routing Algorithm
Control Algorithm
Threefolds
Brownian motion
State Space
Traffic
Converge
Path
Formulation
Model

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

Cita questo

Bauso, D., Zhang, X., & Papachristodoulou, A. (2014). Density Flow over Networks: A Mean-field Game Theoretic Approach. 3469-3474.

Density Flow over Networks: A Mean-field Game Theoretic Approach. / Bauso, Dario; Zhang, Xuan; Papachristodoulou, Antonis.

2014. 3469-3474.

Risultato della ricerca: Other

Bauso, D, Zhang, X & Papachristodoulou, A 2014, 'Density Flow over Networks: A Mean-field Game Theoretic Approach', pagg. 3469-3474.
Bauso, Dario ; Zhang, Xuan ; Papachristodoulou, Antonis. / Density Flow over Networks: A Mean-field Game Theoretic Approach. 6 pag.
@conference{005b265cb18948e298ddc329197a4ed8,
title = "Density Flow over Networks: A Mean-field Game Theoretic Approach",
abstract = "A distributed routing control algorithm for dynamicnetworks has recently been presented in the literature.The networks were modeled using time evolution of densityat network edges and the routing control algorithm allowededge density to converge to a Wardrop equilibrium, which wascharacterized by an equal traffic density on all used paths.We borrow the idea and rearrange the density model to recastthe problem within the framework of mean-field games. Thecontribution of this paper is three-fold. First, we provide amean-field game formulation of the problem at hand. Second,we illustrate an extended state space solution approach. Third,we study the stochastic case where the density evolution isdriven by a Brownian motion.",
author = "Dario Bauso and Xuan Zhang and Antonis Papachristodoulou",
year = "2014",
language = "English",
pages = "3469--3474",

}

TY - CONF

T1 - Density Flow over Networks: A Mean-field Game Theoretic Approach

AU - Bauso, Dario

AU - Zhang, Xuan

AU - Papachristodoulou, Antonis

PY - 2014

Y1 - 2014

N2 - A distributed routing control algorithm for dynamicnetworks has recently been presented in the literature.The networks were modeled using time evolution of densityat network edges and the routing control algorithm allowededge density to converge to a Wardrop equilibrium, which wascharacterized by an equal traffic density on all used paths.We borrow the idea and rearrange the density model to recastthe problem within the framework of mean-field games. Thecontribution of this paper is three-fold. First, we provide amean-field game formulation of the problem at hand. Second,we illustrate an extended state space solution approach. Third,we study the stochastic case where the density evolution isdriven by a Brownian motion.

AB - A distributed routing control algorithm for dynamicnetworks has recently been presented in the literature.The networks were modeled using time evolution of densityat network edges and the routing control algorithm allowededge density to converge to a Wardrop equilibrium, which wascharacterized by an equal traffic density on all used paths.We borrow the idea and rearrange the density model to recastthe problem within the framework of mean-field games. Thecontribution of this paper is three-fold. First, we provide amean-field game formulation of the problem at hand. Second,we illustrate an extended state space solution approach. Third,we study the stochastic case where the density evolution isdriven by a Brownian motion.

UR - http://hdl.handle.net/10447/169144

M3 - Other

SP - 3469

EP - 3474

ER -