Simple games and weighted games: A theoretical and computational viewpoint (Q1028122): Difference between revisions

Let \((N, v)\) be a simple game. It is well known that a simple game is weighted iff it is trade robust. This paper gives a related concept, invariant-trade robust, which leads to a related result. This variant also motivates an algorithm to construct voting weights.