105 citations · 379 across the 28 of their papers we have counts for
4 papers · 1 filter
Sum of Us: Strategyproof Selection from the Selectors
Noga Alon, Felix Fischer, Ariel D. Procaccia +1
We consider directed graphs over a set of n agents, where an edge (i,j) is taken to mean that agent i supports or trusts agent j. Given such a graph and an integer k\leq n, we wish…
Strategyproof Approximation Mechanisms for Location on Networks
Noga Alon, Michal Feldman, Ariel D. Procaccia +1
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an agent…
The structure of almost all graphs in a hereditary property
Noga Alon, Jozsef Balogh, Bela Bollobas +1
A hereditary property of graphs is a collection of graphs which is closed under taking induced subgraphs. The speed of ¶is the function n \mapsto |¶_n|, where ¶_n denotes the graph…
Sums and products along sparse graphs
Noga Alon, Omer Angel, Itai Benjamini +1
In their seminal paper from 1983, Erdős and Szemerédi showed that any distinct integers induce either distinct sums of pairs or that many distinct products, and conje…