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

Jingwei LV, Ze ZHAO, Shuzhen YAO, Weifeng LV

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

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

Author information +
History +

Graphical abstract

Cite this article

EndNote

Ris (Procite)

Bibtex

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 https://doi.org/10.1007/s11704-021-0363-3

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

Supporting Information

The supporting information is available online at journal. hep. com. cn and link. springer. com.

RIGHTS & PERMISSIONS

2022 Higher Education Press
AI Summary AI Mindmap
PDF(1662 KB)

Accesses

Citations

Detail
Sections
Recommended

/

〈 〉