2 citations · 6 across the 8 of their papers we have counts for
9 papers
Mixing predictions for online metric algorithms
Antonios Antoniadis, Christian Coester, Marek Eliáš +2
A major technique in learning-augmented online algorithms is combining multiple algorithms or predictors. Since the performance of each predictor may vary over time, it is desirabl…
Product Portfolio Management in Competitive Environments
Samira Hossein Ghorban, Bardyaa Hesaam
Product diversity is one of the prominent factors for customers' satisfaction, while from the firms' perspective, the additional engineering costs required for product diversity sh…
Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds
Antonios Antoniadis, Christian Coester, Marek Eliáš +2
We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between…
Differentially Private Correlation Clustering
Mark Bun, Marek Eliáš, Janardhan Kulkarni
Correlation clustering is a widely used technique in unsupervised machine learning. Motivated by applications where individual privacy is a concern, we initiate the study of differ…
Online metric algorithms with untrusted predictions
Antonios Antoniadis, Christian Coester, Marek Elias +2
Machine-learned predictors, although achieving very good results for inputs resembling training data, cannot possibly provide perfect predictions in all situations. Still, decision…
Nested Convex Bodies are Chaseable
Nikhil Bansal, Martin Böhm, Marek Eliáš +2
In the Convex Body Chasing problem, we are given an initial point in and an online sequence of convex bodies . When we receive , we are required…
Competitive Algorithms for Generalized k-Server in Uniform Metrics
Nikhil Bansal, Marek Elias, Grigorios Koumoutsos +1
The generalized k-server problem is a far-reaching extension of the k-server problem with several applications. Here, each server lies in its own metric space . A reques…
Weighted k-Server Bounds via Combinatorial Dichotomies
Nikhil Bansal, Marek Elias, Grigorios Koumoutsos
The weighted -server problem is a natural generalization of the -server problem where each server has a different weight. We consider the problem on uniform metrics, which co…
Lower bounds on geometric Ramsey functions
Marek Eliáš, Jiří Matoušek, Edgardo Roldán-Pensado +1
We continue a sequence of recent works studying Ramsey functions for semialgebraic predicates in . A -ary semialgebraic predicate on $\mathbb{R…