research
∙
01/04/2023
Rényi-Ulam Games and Online Computation with Imperfect Advice
We study the nascent setting of online computation with imperfect advice...
share
research
∙
12/02/2021
Online Search With Best-Price and Query-Based Predictions
In the online (time-series) search problem, a player is presented with a...
research
∙
11/09/2021
Competitive Sequencing with Noisy Advice
Several well-studied online resource allocation problems can be formulat...
research
∙
02/05/2021
Online Bin Packing with Predictions
Bin packing is a classic optimization problem with a wide range of appli...
research
∙
11/28/2020
Online Search with Maximum Clearance
We study the setting in which a mobile agent must locate a hidden target...
research
∙
11/24/2020
Contract Scheduling With Predictions
Contract scheduling is a general technique that allows to design a syste...
research
∙
08/31/2020
Online Search With a Hint
The linear search problem, informally known as the cow path problem, is ...
research
∙
08/06/2019
Competitive Search in a Network
We study the classic problem in which a Searcher must locate a hidden po...
research
∙
05/14/2019
Online Computation with Untrusted Advice
The advice model of online computation captures the setting in which the...
research
∙
10/26/2018
Interruptible Algorithms for Multiproblem Solving
In this paper we address the problem of designing an interruptible syste...
research
∙
10/18/2018
Best-of-two-worlds analysis of online search
In search problems, a mobile searcher seeks to locate a target that hide...
research
∙
01/10/2018
Online Maximum Matching with Recourse
We study the online maximum matching problem with recourse in a model in...
research
∙
04/27/2015