Simultaneous Competitive and Regret Guarantees for TCP Acknowledgment
The study developed a randomized online algorithm for TCP acknowledgment that guarantees a competitive ratio arbitrarily close to two while achieving sublinear expected regret against the best offline expert. The algorithm works by learning from observed costs and intelligently switching between different randomized strategies, requiring no prior knowledge of packet counts or the optimal cost.