On Re-Balancing Self-Interested Agents in Ride-Sourcing Transportation\n Networks
Bibliographic record
Abstract
This paper focuses on the problem of controlling self-interested drivers in\nride-sourcing applications. Each driver has the objective of maximizing its\nprofit, while the ride-sourcing company focuses on customer experience by\nseeking to minimizing the expected wait time for pick-up. These objectives are\nnot usually aligned, and the company has no direct control on the waiting\nlocations of the drivers. In this paper, we provide two indirect control\nmethods to optimize the set of waiting locations of the drivers, thereby\nminimizing the expected wait time of the customers: 1) sharing the location of\nall drivers with a subset of drivers, and 2) paying the drivers to relocate. We\nshow that finding the optimal control for each method is NP-hard and we provide\nalgorithms to find near-optimal control in each case. We evaluate the\nperformance of the proposed control methods on real-world data and show that we\ncan achieve between 20% to 80% improvement in the expected response.\n
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".