Conclusion
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.
This is a preview of subscription content, log in via an institution to check access.
References
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
Author information
Authors and Affiliations
Corresponding author
Additional information
Supporting information
The supporting information is available online at journal.hep.com.cn and link.springer.com.
Rights and permissions
About this article
Cite this article
Lv, J., Zhao, Z., Yao, S. et al. Revenue-maximizing online stable task assignment on taxi-dispatching platforms. Front. Comput. Sci. 16, 166208 (2022). https://doi.org/10.1007/s11704-021-0363-3
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11704-021-0363-3