AI Paper Atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Preference-Aware Task Assignment in On-Demand Taxi Dispatching: An Online Stable Matching Approach

Boming Zhao, Pan Xu, Yexuan Shi, Yongxin Tong, Zimu Zhou, Yuxiang Zeng

AAAI 2019 · Learning theory and algorithms › Submodular and game algorithms · approach: Matching markets and welfare

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use LP-ALG instead of Greedy and Greedy-RTOnline taxi task assignment · Real and synthetic datasets, 500-1500 driversblocking pair ratio: below 0.1Improved
Use LP-ALG instead of Greedy and Greedy-RTOnline taxi task assignment · Real and synthetic datasets, few driverscompetitive ratioImproved
Increase the number of drivers from 500 to 1500LP-ALG versus baselines · Real and synthetic datasetscompetitive ratio and blocking pairs advantageHurt
Use LinUOTD to predict arrival rates instead of Historical Average, Linear Regression, Neural Network or GBRTArrival distribution prediction · DiDi Chengdu training daysprediction qualityImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy