no code implementations • 6 Jul 2017 • Mengjing Chen, Weiran Shen, Pingzhong Tang, Song Zuo
To this end, we use a so-called "ironing" technique to convert the problem into an equivalent convex optimization one via a clean Markov decision process (MDP) formulation, where the states are the driver distributions and the decision variables are the prices for each pair of locations.
