Markov Decision Process Routing Games | IEEE Conference Publication | IEEE Xplore

Markov Decision Process Routing Games


Abstract:

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 netw...Show More

Abstract:

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. We define the appropriate version of a Wardrop equilibrium as well as a potential function for this game in the finite horizon (total reward) case. 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 the problem of ridesharing drivers competing for customers.
Date of Conference: 18-21 April 2017
Date Added to IEEE Xplore: 12 June 2017
ISBN Information:
Conference Location: Pittsburgh, PA, USA
Univ. of California, Berkeley
University of California Berkeley, Berkeley, CA, US

Univ. of California, Berkeley
University of California Berkeley, Berkeley, CA, US

Contact IEEE to Subscribe

References

References is not available for this document.