Research Seminar
is an essential property in the setting of matchings under preferences and often considered in the sense of fairness. Meanwhile, a matching is called rank-maximal if it maximizes the number of participants [...] of the prediction. For the special case of two servers, we show that this family is in a certain sense optimal among all learning-augmented algorithms for the problem. We also state a modification of the [...] interested in designing competitive algorithms. In this talk, we solve the problem in the classical sense: We give a lower bound of 2 on the competitive ratio of any possibly randomized online algorithm,