2019/03/04 by Istrate, Gabriel, Bonchiş, Cosmin, Brînduşescu, Alin
#Artificial Intelligence (cs.AI) #Computer Science and Game Theory (cs.GT) #FOS: Computer and information sciences #Multiagent Systems (cs.MA) #Social and Information Networks (cs.SI)
paper · doi:10.48550/arxiv.1903.01165
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.