4 papers
A Combinatorial Proof of Cayley's Formula via Degree Sequences
Helia Karisani, Mohammadreza Daneshvaramoli
Cayley's formula is a fundamental result in combinatorics that counts the number of labeled trees on n vertices. While existing proofs use approaches such as Prufer sequences and t…
The Secretary Problem with Predictions and a Chosen Order
Helia Karisani, Mohammadreza Daneshvaramoli, Hedyeh Beyhaghi +2
We study a learning-augmented variant of the secretary problem, recently introduced by Fujii and Yoshida (2023), in which the decision-maker has access to machine-learned predictio…
Fairness in the k-Server Problem
Mohammadreza Daneshvaramoli, Helia Karisani, Mohammad Hajiesmaili +2
We initiate a formal study of fairness for the -server problem, where the objective is not only to minimize the total movement cost, but also to distribute the cost equitably am…
Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems
Mohammadreza Daneshvaramoli, Helia Karisani, Adam Lechowicz +3
This paper introduces a family of learning-augmented algorithms for online knapsack problems that achieve near Pareto-optimal consistency-robustness trade-offs through a simple com…