-
Exploitation of Multiple Replenishing Resources with Uncertainty
We consider an optimization problem in which a (single) bat aims to expl...
07/19/2020 ∙ by Amos Korman, et al. ∙
0
∙
share
read it
-
The Search Efficiency of Intermittent Lévy walks Optimally Scales with Target Size
We address the general question of what is the best strategy to employ w...
03/29/2020 ∙ by Brieuc Guinard, et al. ∙
0
∙
share
read it
-
Tight Bounds for the Cover Times of Random Walks with Heterogeneous Step Lengths
Search patterns of randomly oriented steps of different lengths have bee...
02/13/2020 ∙ by Brieuc Guinard, et al. ∙
0
∙
share
read it
-
Cooperative Search Games: Symmetric Equilibria, Robustness, and Price of Anarchy
Assume that a treasure is placed in one of M boxes according to a known ...
11/03/2018 ∙ by Amos Korman, et al. ∙
0
∙
share
read it
-
Intense Competition can Drive Selfish Explorers to Optimize Coverage
We consider a game-theoretic setting in which selfish individuals compet...
05/03/2018 ∙ by Simon Collet, et al. ∙
0
∙
share
read it
-
Limits for Rumor Spreading in stochastic populations
Biological systems can share and collectively process information to yie...
12/20/2017 ∙ by Lucas Boczkowski, et al. ∙
0
∙
share
read it
-
The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback
We introduce the dependent doors problem as an abstraction for situation...
04/20/2017 ∙ by Amos Korman, et al. ∙
0
∙
share
read it
