We explore an extension of nonatomic routing games that we call Markov decision process routing games where each agent chooses a transition policy between nodes in a network rather than a path from an origin node to a destination node, i.e. each agent in the population solves a Markov decision process rather than a shortest path problem. This type of game was first introduced in [1] in the finite-horizon total-cost case. Here we present the infinite-horizon average-cost case. We present the appropriate definition of a Wardrop equilibrium as well as a potential function program for finding the equilibrium. This work can be thought of as a routing-game-based formulation of continuous population stochastic games (mean-field games or anonymous sequential games). We apply our model to ridesharing drivers competing for fares in an urban area.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Infinite-horizon average-cost Markov decision process routing games


    Contributors:


    Publication date :

    2017-10-01


    Size :

    1331804 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Pareto Optimality in Infinite Horizon Cooperative Difference Games

    Lin, Yaning / Zhang, Weihai | Springer Verlag | 2022



    Bayesian Optimization for Multi-Agent Routing in Markov Games

    Shou, Zhenyu / Chen, Xu / Di, Xuan | IEEE | 2022


    A Markov decision process approach to vacant taxi routing with e-hailing

    Yu, Xinlian / Gao, Song / Hu, Xianbiao et al. | Elsevier | 2018


    Infinite-Horizon Degradation Control Based on Optimization of Degradation-Aware Cost Function

    Hosseinzadeh Dadash, Amirhossein / Björsell, Niclas | BASE | 2024

    Free access