3 problems

0 votes0 replies0 views
Alpern's asymptotic optimality conjecture for rendezvous on the cycle
Alpern's conjecture. This strategy asymptotically minimizes the expected meeting time on the cycle.
Conjectureopencycles graph-theory rendezvous-problemarXiv posted 2 days ago
0 votes0 replies0 views
Anderson–Weber's asymptotic optimality conjecture for symmetric rendezvous
Anderson–Weber's conjecture. The strategy with optimized parameter $\theta=0.249\ldots$ , which achieves expected meeting time $(0.829\ldots)n$ , is asymptotically optimal: the const…
Conjectureopencomplete-graphs probabilistic-combinatorics rendezvous-problemarXiv posted 2 days ago
0 votes0 replies1 view
The linearithmic lower-bound conjecture for rendezvous algorithms
Linearithmic lower-bound conjecture. Any algorithm assuming RP 1–5 requires time
Conjectureopenalgorithms multi-agent-systems rendezvous-problemarXiv posted 2 days ago

Alpern's asymptotic optimality conjecture for rendezvous on the cycle