The SBP Algorithm for Maximizing Revenue in Online Dial-a-Ride

12/13/2019
by   Ananya Christman, et al.
0

In the Online-Dial-a-Ride Problem (OLDARP) a server travels through a metric space to serve requests for rides. We consider a variant where each request specifies a source, destination, release time, and revenue that is earned for serving the request. The goal is to maximize the total revenue earned within a given time limit. We prove that no non-preemptive deterministic online algorithm for OLDARP can be guaranteed to earn more than twice the revenue earned by an optimal offline solution. We then investigate the segmented best path (SBP) algorithm of <cit.> for the general case of weighted graphs. The previously-established lower and upper bounds for the competitive ratio of SBP are 4 and 6, respectively, under reasonable assumptions about the input instance. We eliminate the gap by proving that the competitive ratio is 5 (under the same reasonable assumptions). We also prove that when revenues are uniform, SBP has competitive ratio 4. Finally, we provide a competitive analysis of SBP on complete bipartite graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2018

Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line

In the online metric bipartite matching problem, we are given a set S of...
research
10/20/2022

Competitive Online Truthful Time-Sensitive-Valued Data Auction

In this work, we investigate online mechanisms for trading time-sensitiv...
research
11/22/2016

Randomized Mechanisms for Selling Reserved Instances in Cloud

Selling reserved instances (or virtual machines) is a basic service in c...
research
07/14/2021

Online Allocation and Display Ads Optimization with Surplus Supply

In this work, we study a scenario where a publisher seeks to maximize it...
research
06/11/2022

Online Paging with Heterogeneous Cache Slots

It is natural to generalize the k-Server problem by allowing each reques...
research
06/01/2022

Learning-Augmented Algorithms for Online TSP on the Line

We study the online Traveling Salesman Problem (TSP) on the line augment...
research
06/17/2020

DCAF: A Dynamic Computation Allocation Framework for Online Serving System

Modern large-scale systems such as recommender system and online adverti...

Please sign up or login with your details

Forgot password? Click here to reset