Switch to: References

Add citations

You must login to add citations.
  1. Trading transforms of non-weighted simple games and integer weights of weighted simple games.Tomomi Matsui & Akihiro Kawana - 2021 - Theory and Decision 93 (1):131-150.
    This study investigates simple games. A fundamental research question in this field is to determine necessary and sufficient conditions for a simple game to be a weighted majority game. Taylor and Zwicker showed that a simple game is non-weighted if and only if there exists a trading transform of finite size. They also provided an upper bound on the size of such a trading transform, if it exists. Gvozdeva and Slinko improved that upper bound; their proof employed a property of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On anonymous and weighted voting systems.Josep Freixas & Montserrat Pons - 2021 - Theory and Decision 91 (4):477-491.
    Many bodies around the world make their decisions through voting systems in which voters have several options and the collective result also has several options. Many of these voting systems are anonymous, i.e., all voters have an identical role in voting. Anonymous simple voting games, a binary vote for voters and a binary collective decision, can be represented by an easy weighted game, i.e., by means of a quota and an identical weight for the voters. Widely used voting systems of (...)
    Download  
     
    Export citation  
     
    Bookmark