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

被引：0
|
作者：
Lv, Jingwei [1 ]
Zhao, Ze [2 ]
Yao, Shuzhen [1 ]
Lv, Weifeng [1 ]
机构：
[1] Beihang Univ, Sch Comp Sci & Engn, Beijing 100191, Peoples R China
[2] Beihang Univ, Sch Math Sci, Beijing 100191, Peoples R China
来源：
FRONTIERS OF COMPUTER SCIENCE | 2022年 / 16卷 / 06期
关键词：
4;
D O I：
10.1007/s11704-021-0363-3
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
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.
引用
收藏
页数：3
相关论文
共 9 条
  • [1] Revenue-maximizing online stable task assignment on taxi-dispatching platforms
    Jingwei Lv
    Ze Zhao
    Shuzhen Yao
    Weifeng Lv
    [J]. Frontiers of Computer Science, 2022, 16
  • [2] Revenue-maximizing online stable task assignment on taxi-dispatching platforms
    Jingwei LV
    Ze ZHAO
    Shuzhen YAO
    Weifeng LV
    [J]. Frontiers of Computer Science., 2022, 16 (06) - 173
  • [3] Revenue-Maximizing Rankings for Online Platforms with Quality-Sensitive Consumers
    L'Ecuyer, Pierre
    Maille, Patrick
    Stier-Moses, Nicolas E.
    Tuffin, Bruno
    [J]. OPERATIONS RESEARCH, 2017, 65 (02) : 408 - 423
  • [4] Preference-Aware Task Assignment in On-Demand Taxi Dispatching: An Online Stable Matching Approach
    Zhao, Boming
    Xu, Pan
    Shi, Yexuan
    Tong, Yongxin
    Zhou, Zimu
    Zeng, Yuxiang
    [J]. THIRTY-THIRD AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE / THIRTY-FIRST INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE / NINTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2019, : 2245 - 2252
  • [5] A Revenue-Maximizing Bidding Strategy for Demand-Side Platforms
    Wang, Tengyun
    Yang, Haizhi
    Yu, Han
    Zhou, Wenjun
    Liu, Yang
    Song, Hengjie
    [J]. IEEE ACCESS, 2019, 7 : 68692 - 68706
  • [6] Revenue-maximizing and Truthful Online Auctions for Dynamic Spectrum Access
    Gopinathan, Ajay
    Carlsson, Niklas
    Li, Zongpeng
    Wu, Chuan
    [J]. 2016 12TH ANNUAL CONFERENCE ON WIRELESS ON-DEMAND NETWORK SYSTEMS AND SERVICES (WONS), 2016, : 1 - 8
  • [7] Matchmaker: Stable Task Assignment With Bounded Constraints for Crowdsourcing Platforms
    Yin, Xiaoyan
    Chen, Yanjiao
    Xu, Cheng
    Yu, Sijia
    Li, Baochun
    [J]. IEEE INTERNET OF THINGS JOURNAL, 2021, 8 (03) : 1599 - 1610
  • [8] Three-sided online stable task assignment in spatial crowdsourcing
    Huang, Weiyi
    Li, Peng
    Li, Bo
    Liu, Qin
    Nie, Lei
    Bao, Haizhou
    [J]. INFORMATION SCIENCES, 2024, 654
  • [9] Online Stable Task Assignment in Opportunistic Mobile Crowdsensing With Uncertain Trajectories
    Yucel, Fatih
    Bulut, Eyuphan
    [J]. IEEE INTERNET OF THINGS JOURNAL, 2022, 9 (11): : 9086 - 9101
1