Attacking Power Indices by Manipulating Player Reliability
This addresses a security or fairness issue in cooperative game theory for researchers and practitioners, but it is incremental as it builds on existing power index and manipulation concepts.
The paper tackles the problem of manipulating power indices in cooperative games by influencing other players' participation probabilities under budget constraints, showing that optimal manipulation is often tractable for network centrality and influence attribution games but can be intractable in some cases.
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.