Search Results for author:
Found 5 papers, 3 papers with code
Robust Learning-Augmented Dictionaries
We present the first learning-augmented data structure for implementing dictionaries with optimal consistency and robustness.
Time Fairness in Online Knapsack Problems
We propose a parameterized deterministic algorithm where the parameter precisely captures the Pareto-optimal trade-off between fairness (static pricing) and competitiveness (dynamic pricing).
Online Search With Best-Price and Query-Based Predictions
In the standard definition of the problem, for each revealed price, the player must decide irrevocably whether to accept or reject it, without knowledge of future prices (other than an upper and a lower bound on their extreme values), and the objective is to minimize the competitive ratio, namely the worst-case ratio between the maximum price in the sequence and the one selected by the player.
Online Bin Packing with Predictions
Bin packing is a classic optimization problem with a wide range of applications, from load balancing to supply chain management.
Contract Scheduling With Predictions
Contract scheduling is a general technique that allows to design a system with interruptible capabilities, given an algorithm that is not necessarily interruptible.
