Aiming to overcome some of the limitations of worst-case analysis, the recently proposed
framework of" algorithms with predictions" allows algorithms to be augmented with a …

The realm of algorithms with predictions has led to the development of several new
algorithms that leverage predictions to enhance their performance guarantees. The …

We provide the first analysis of (deferred acceptance) clock auctions in the learning-
augmented framework. These auctions satisfy a unique list of very appealing properties …

The study of online algorithms with machine-learned predictions has gained considerable
prominence in recent years. One of the common objectives in the design and analysis of …

The study of online algorithms with machine-learned predictions has gained considerable
prominence in recent years. One of the common objectives in the design and analysis of …

We study stationary online bipartite matching, where both types of nodes--offline and online--
arrive according to Poisson processes. Offline nodes wait to be matched for some random …

We consider the secretary problem through the lens of learning-augmented algorithms. As it
is known that the best possible expected competitive ratio is $1/e $ in the classic setting …

Pandora's Box is a fundamental stochastic optimization problem, where the decision-maker
must find a good alternative, while minimizing the search cost of exploring the value of each …

Beyond 5 G and 6 G, communication systems should be able to deliver high throughput, low
latency, high dependability, and high energy efficiency services. The creation of hybrid …

A variant of the online knapsack problem is considered in the setting of predictions. In Unit
Profit Knapsack, the items have unit profit, ie, the goal is to pack as many items as possible …