Andreas Marfurt

  • Citations Per Year
Learn More
Suppose there is a large collection of items, each with an associated cost and an inherent utility that is revealed only once we commit to selecting it. Given a budget on the cumulative cost of the selected items, how can we pick a subset of maximal value? This task generalizes several important problems such as multi-arm bandits, active search and the(More)
We study the Ants Nearby Treasure Search (ANTS) problem that has been introduced by Feinerman, Korman, Lotker, and Sereni (PODC 2012). The ANTS problem consists of n ants, initially placed at the origin of the infinite grid, which have to collaboratively locate food that is placed by an adversary. We follow the restrictions on the ants’ computational power(More)
  • 1