Online Unit Profit Knapsack with Untrusted Predictions

03/01/2022
by   Joan Boyar, et al.
0

A variant of the online knapsack problem is considered in the settings of trusted and untrusted predictions. In Unit Profit Knapsack, the items have unit profit, and it is easy to find an optimal solution offline: Pack as many of the smallest items as possible into the knapsack. For Online Unit Profit Knapsack, the competitive ratio is unbounded. In contrast, previous work on online algorithms with untrusted predictions generally studied problems where an online algorithm with a constant competitive ratio is known. The prediction, possibly obtained from a machine learning source, that our algorithm uses is the average size of those smallest items that fit in the knapsack. For the prediction error in this hard online problem, we use the ratio r=a/â where a is the actual value for this average size and â is the prediction. The algorithm presented achieves a competitive ratio of 1/2r for r≥ 1 and r/2 for r≤ 1. Using an adversary technique, we show that this is optimal in some sense, giving a trade-off in the competitive ratio attainable for different values of r. Note that the result for accurate advice, r=1, is only 1/2, but we show that no algorithm knowing the value a can achieve a competitive ratio better than e-1/e≈ 0.6321 and present an algorithm with a matching upper bound. We also show that this latter algorithm attains a competitive ratio of re-1/e for r ≤ 1 and e-r/e for 1 ≤ r < e, and no algorithm can be better for both r<1 and 1≤ r<e.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/20/2019

A Competitive Analysis of Online Knapsack Problems with Unit Density

We study an online knapsack problem where the items arrive sequentially ...
research
08/08/2022

Solving the Online Assignment Problem with Machine Learned Advice

The online assignment problem plays an important role in operational res...
research
06/14/2023

The Secretary Problem with Predictions

The value maximization version of the secretary problem is the problem o...
research
12/28/2018

Online Trading as a Secretary Problem

We consider the online problem in which an intermediary trades identical...
research
11/09/2021

Competitive Sequencing with Noisy Advice

Several well-studied online resource allocation problems can be formulat...
research
10/17/2021

Online Facility Location with Predictions

We provide nearly optimal algorithms for online facility location (OFL) ...
research
07/25/2023

Online Maximum Independent Set of Hyperrectangles

The maximum independent set problem is a classical NP-hard problem in th...

Please sign up or login with your details

Forgot password? Click here to reset