no code implementations • 3 Feb 2021 • Kasper Green Larsen, Rasmus Pagh, Jakub Tětek
For $t > 1$, the estimator takes the median of $2t-1$ independent estimates, and the probability that the estimate is off by more than $2 \|v\|_2/\sqrt{s}$ is exponentially small in $t$.
no code implementations • 12 Nov 2020 • Jakub Tětek, Marek Sklenka, Tomáš Gavenčiak
We show that this result is no longer true for agents with bounded rationality.
no code implementations • 23 Sep 2020 • Jakub Tětek
We also note that sampling edges from a distribution sufficiently close to uniform is sufficient to be able to simulate sublinear algorithms that use the random edge queries while decreasing the success probability of the algorithm only by $o(1)$.
Data Structures and Algorithms
