"On Finding Target Sets via a budgeted Bi-Level Consensus Approximation"
The problem of finding a set of "influencing" nodes in a graph that minimizes the amount of time required for a group to converge to a consensus of opinions is a difficult network optimization problem. The bi-level model introduces a two player game, where one player, the attacker, attempts to capture a set of highly influential nodes within a budget constraint. While the other player, the defender, attempts to prevent highly influential nodes from being targeted. This talk will survey some of the techniques used to find solutions to this problem, as well as the simpler approximation - the bi-level mean absorption time problem.