The problem of finding the minimum tipping set in a super modular game is known to be NP-hard. Here, I derive an approximation algorithm to find a small tipping set in such a game. In the special case of the uniform game, ...