This paper studies a decentralized routing problem over a network through a mean field game approach. Using a state space extension technique we recast the problem in the framework of optimal control. The main contribution is an explicit expression of the optimal decentralized control to provide conditions for the convergence both to local and global equilibrium. Furthermore, we study the stability of the system also in the presence of a delay due to a hysteresis operator. The presence of this operator leads to have more equilibria, nevertheless it is possible to achieve a convergence result. The stability analysis is supported by numerical experiments
Call admission and routing control decisions in stochastic loss (circuit-switched) networks with sem...
We consider the problem of dynamic flow control of arriving packets into an infinite buffer. The ser...
A distributed routing control algorithm for dynamic networks has recently been presented in the lite...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
4This paper studies a decentralized routing problem over a network, using the paradigm of mean-field...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
The thesis deals with various problems arising in deterministic control, jumping processes and contr...
Current distributed routing control algorithms for dynamic networks model networks using the time ev...
This paper provides a decentralized approach for the control of a population of N agents to minimize...
We study a novel control problem in the context of network coordination games: the individuation of ...
We study in this paper optimal stochastic control issues in delay tolerant networks. We first derive...
Call admission and routing control decisions in stochastic loss (circuit-switched) networks with sem...
We consider the problem of dynamic flow control of arriving packets into an infinite buffer. The ser...
A distributed routing control algorithm for dynamic networks has recently been presented in the lite...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
4This paper studies a decentralized routing problem over a network, using the paradigm of mean-field...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
This paper studies a decentralized routing problem over a network, using the paradigm of mean-field ...
The thesis deals with various problems arising in deterministic control, jumping processes and contr...
Current distributed routing control algorithms for dynamic networks model networks using the time ev...
This paper provides a decentralized approach for the control of a population of N agents to minimize...
We study a novel control problem in the context of network coordination games: the individuation of ...
We study in this paper optimal stochastic control issues in delay tolerant networks. We first derive...
Call admission and routing control decisions in stochastic loss (circuit-switched) networks with sem...
We consider the problem of dynamic flow control of arriving packets into an infinite buffer. The ser...
A distributed routing control algorithm for dynamic networks has recently been presented in the lite...