3 problems

0 votes0 replies0 views
Anderson–Weber conjecture on improving the symmetric rendezvous strategy for four locations
Let $n$ denote the number of locations in the symmetric rendezvous problem, and let $\mathrm{AW}$ denote the Anderson–Weber strategy. Anderson–Weber's conjecture. An improvement ov…
Conjectureopenprobabilistic-combinatorics rendezvous-problemsarXiv posted 2 days ago
0 votes0 replies0 views
Conjecture on the optimal asymmetric competitive ratio for rendezvous on a line
Consider the rendezvous problem on the real line in which two players start at distance two and have no common orientation, and let the competitive ratio be the ratio of the meetin…
Conjectureopenonline-algorithms rendezvous-problemsarXiv posted 2 days ago
0 votes0 replies1 view
Anderson–Weber conjecture on asymptotic optimality
Let $n$ be the number of locations in the symmetric rendezvous problem, and let $\mathrm{AW}$ denote the Anderson–Weber strategy. Anderson–Weber's asymptotic optimality conjecture.…
Conjectureopenasymptotic-optimization rendezvous-problemsarXiv posted 2 days ago

Anderson–Weber conjecture on improving the symmetric rendezvous strategy for four locations