2 citations · 2 across the 5 of their papers we have counts for
7 papers
Learning-Augmented Online TSP on Rings, Trees, Flowers and (almost) Everywhere Else
Evripidis Bampis, Bruno Escoffier, Themis Gouleakis +4
We study the Online Traveling Salesperson Problem (OLTSP) with predictions. In OLTSP, a sequence of initially unknown requests arrive over time at points (locations) of a metric sp…
The Covering Canadian Traveller Problem Revisited
Niklas Hahn, Michalis Xefteris
In this paper, we consider the -Covering Canadian Traveller Problem (-CCTP), which can be seen as a variant of the Travelling Salesperson Problem. The goal of -CCTP is fin…
Online TSP with Known Locations
Evripidis Bampis, Bruno Escoffier, Niklas Hahn +1
In this paper, we consider the Online Traveling Salesperson Problem (OLTSP) where the locations of the requests are known in advance, but not their arrival times. We study both the…
Delegated Online Search
Pirmin Braun, Niklas Hahn, Martin Hoefer +1
In a delegation problem, a principal P with commitment power tries to pick one out of options. Each option is drawn independently from a known distribution. Instead of inspecti…
Algorithms for Persuasion with Limited Communication
Ronen Gradwohl, Niklas Hahn, Martin Hoefer +1
The Bayesian persuasion paradigm of strategic communication models interaction between a privately-informed agent, called the sender, and an ignorant but rational agent, called the…
Reaping the Informational Surplus in Bayesian Persuasion
Ronen Gradwohl, Niklas Hahn, Martin Hoefer +1
The Bayesian persuasion model studies communication between an informed sender and a receiver with a payoff-relevant action, emphasizing the ability of a sender to extract maximal…
The Secretary Recommendation Problem
Niklas Hahn, Martin Hoefer, Rann Smorodinsky
In this paper we revisit the basic variant of the classical secretary problem. We propose a new approach in which we separate between an agent that evaluates the secretary performa…