Attacking Power Indices by Manipulating Player Reliability

03/04/2019
by   Gabriel Istrate, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/31/2018

On the Complexity of the Inverse Semivalue Problem for Weighted Voting Games

Weighted voting games are a family of cooperative games, typically used ...
research
03/13/2018

The power of the largest player

Decisions in a shareholder meeting or a legislative committee are often ...
research
08/20/2021

Worst-case Bounds on Power vs. Proportion in Weighted Voting Games with Application to False-name Manipulation

Weighted voting games apply to a wide variety of multi-agent settings. T...
research
11/14/2017

Feature importance scores and lossless feature pruning using Banzhaf power indices

Understanding the influence of features in machine learning is crucial t...
research
08/22/2022

Generalised Gately Values of Cooperative Games

We investigate Gately's solution concept for cooperative games with tran...
research
09/09/2016

Measuring Player's Behaviour Change over Time in Public Goods Game

An important issue in public goods game is whether player's behaviour ch...
research
01/03/2020

Convolution Idempotents with a given Zero-set

We investigate the structure of N-length discrete signals h satisfying h...

Please sign up or login with your details

Forgot password? Click here to reset