Simple games and weighted games: A theoretical and computational viewpoint (Q1028122)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Simple games and weighted games: A theoretical and computational viewpoint |
scientific article; zbMATH DE number 5571993
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple games and weighted games: A theoretical and computational viewpoint |
scientific article; zbMATH DE number 5571993 |
Statements
Simple games and weighted games: A theoretical and computational viewpoint (English)
0 references
30 June 2009
0 references
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.
0 references
simple games
0 references
trade robust
0 references
weighted
0 references
invariant-trade robust
0 references
