Throughput-fairness tradeoffs in mobile task fulfillment platforms
Name
1252062558-MIT.pdf
Size
8.56 MB
Format
Adobe PDF
Checksum (MD5)
a4dd11a044c7989c9103b77940b0ebaf
Author(s)
Balasingam, Arjun(Arjun Varman)
Advisor(s)
Hari Balakrishnan.
Date Issued
2021
Publisher
Massachusetts Institute of Technology
Abstract
This thesis studies the problem of allocating tasks from different customers to vehicles in mobility platforms, which are used for applications like food and package delivery, ridesharing, and urban monitoring. A mobility platform should allocate tasks to vehicles and schedule their order to optimize both throughput as well as fairness of the achieved task completion rates across customers. We find that there are interesting, new tradeoffs between fairness and throughput caused by shared mobility, and develop a method using guided optimization to manage the tradeoffs to achieve both high throughput and fairness across customers. We evaluate our system, Mobius, on traces gathered from ridesharing and aerial sensing applications.
Description
Thesis: S.M., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, February, 2021
Cataloged from the official PDF version of thesis.
Includes bibliographical references (pages 55-57).
Subjects
Electrical Engineering and Computer Science.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
MIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.
Persistent DSpace Link
