4 citations · 4 across the 3 of their papers we have counts for
4 papers
Anarchy is free in network creation
Ronald Graham, Linus Hamilton, Ariel Levavi +1
The Internet has emerged as perhaps the most important network in modern computing, but rather miraculously, it was created through the individual actions of a multitude of agents…
Tight Lower Bounds on Envy-Free Makespan Approximation
Amos Fiat, Ariel Levavi
In this work we give a tight lower bound on makespan approximations for envy-free allocation mechanism dedicated to scheduling tasks on unrelated machines. Specifically, we show th…
Pegging Numbers For Various Tree Graphs
Ariel Levavi
In the game of pegging, each vertex of a graph is considered a hole into which a peg can be placed. A pegging move is performed by jumping one peg over another peg, and then removi…
Strong Robustness of Randomized Rumor Spreading Protocols
Benjamin Doerr, Anna Huber, Ariel Levavi
Randomized rumor spreading is a classical protocol to disseminate information across a network. At SODA 2008, a quasirandom version of this protocol was proposed and competitive bo…