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

From MaRDI portal
Revision as of 18:06, 1 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Simple games and weighted games: A theoretical and computational viewpoint
scientific article

    Statements

    Simple games and weighted games: A theoretical and computational viewpoint (English)
    0 references
    0 references
    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

    Identifiers