Game Theory for Networks. 2nd International ICST Conference, GAMENETS 2011, Shanghai, China, April 16-18, 2011, Revised Selected Papers

Research Article

Spatio-temporal Control for Dynamic Routing Games

Download
378 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-30373-9_15,
        author={Manjesh Hanawal and Eitan Altman and Rachid El-Azouzi and Balakrishna Prabhu},
        title={Spatio-temporal Control for Dynamic Routing Games},
        proceedings={Game Theory for Networks. 2nd International ICST Conference, GAMENETS 2011, Shanghai, China, April 16-18, 2011, Revised Selected Papers},
        proceedings_a={GAMENETS},
        year={2012},
        month={10},
        keywords={},
        doi={10.1007/978-3-642-30373-9_15}
    }
    
  • Manjesh Hanawal
    Eitan Altman
    Rachid El-Azouzi
    Balakrishna Prabhu
    Year: 2012
    Spatio-temporal Control for Dynamic Routing Games
    GAMENETS
    Springer
    DOI: 10.1007/978-3-642-30373-9_15
Manjesh Hanawal,*, Eitan Altman1,*, Rachid El-Azouzi2,*, Balakrishna Prabhu,*
  • 1: Maestro group, INRIA
  • 2: LIA, University of Avignon
*Contact email: mhanawal@inria.fr, eitan.altman@inria.fr, rachid.elazouzi@univ-avignon.fr, balakrishna.prabhu@laas.fr

Abstract

In this paper, we study dynamic routing games where the decision of an user is spatio-temporal control. Each user ships its demand over time on a shared resource. We investigate the equilibrium of such systems and show the existence and uniqueness of equilibrium. In the second part, we study a stochastic congestion games where there is only one shared resource and the traffic is indivisible. The information structure that we consider is such that each user knows the state of its own buffer but not aware of states and the actions taken by other users. The game can be described as a game with random environment. We characterize the structure of equilibria policies using linear programming. We also study the properties of equilibrium considering another model for stochastic congestion game in which a fixed amount of divisible demand arrives each day. This demand can shipped to destination by sending some part today and remaining the next day.