Revenue-maximizing online stable task assignment on taxi-dispatching platforms

Jingwei LV; Ze ZHAO; Shuzhen YAO; Weifeng LV

doi:10.1007/s11704-021-0363-3

Front. Comput. Sci. ›› 2022, Vol. 16 ›› Issue (6) : 166208 DOI: 10.1007/s11704-021-0363-3

Software

LETTER

Revenue-maximizing online stable task assignment on taxi-dispatching platforms

Author information +

History +

PDF (1662KB)

Graphical abstract

Cite this article

Download citation ▾

Jingwei LV, Ze ZHAO, Shuzhen YAO, Weifeng LV. Revenue-maximizing online stable task assignment on taxi-dispatching platforms. Front. Comput. Sci., 2022, 16(6): 166208 DOI:10.1007/s11704-021-0363-3

登录浏览全文

4963

注册一个新账户忘记密码

References

Publishing order | Descend order by publishing year | Descend order by cited within

[1]	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

[2]	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

[3]	Gale D , Shapley L S . College admissions and the stability of marriage. The American Mathematical Monthly, 1962, 69( 1): 9– 15

[4]	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