Revenue-maximizing online stable task assignment on taxi-dispatching platforms
Tóm tắt
We identify a problem about dynamic task assignment, called RMOSM Problem, then introduce the concept Substitutable and design a novel algorithm Equation-Substitutable Online Matching (ESOM). Finally we conduct experiments that verify the efficiency and effectiveness of the proposed approaches.
Tài liệu tham khảo
Wong R C W, Tao Y, Fu A W C, Xiao X. On efficient spatial matching. In: Proceedings of the 33rd International Conference on Very Large Data Bases. 2007, 579–590
Karp R M, Vazirani U V, Vazirani V V. An optimal algorithm for on-line bipartite matching. In: Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 1990, 352–358
Gale D, Shapley L S. College admissions and the stability of marriage. The American Mathematical Monthly, 1962, 69(1): 9–15
Xia C, Muthukrishnan S. Revenue-maximizing stable pricing in online labor markets. In: Proceedings of the 5th AAAI Conference on Human Computation and Crowdsourcing. 2017, 216–225