Researchers have designed an algorithm that is able to balance the information exposure so that social media users can be exposed to information from both sides of the discussion.

We propose using a computationally efficient procedure, the Chebyshev greedy algorithm (CGA), to sequentially include variables, and derive its convergence rate under a weak sparsity condition. When ...

We consider the expected performance of two greedy matching algorithms on sparse random graphs and also on random trees. In all cases we establish expressions for the mean and variance of the number ...