  We investigate the manipulation of power indices in TU-cooperative games by
stimulating (subject to a budget constraint) changes in the propensity of other
players to participate to the game.
  We display several algorithms that show that the problem is often tractable
for so-called network centrality games and influence attribution games, as well
as an example when optimal manipulation is intractable, even though computing
power indices is feasible.
