Hierarchy of players in swap robust voting games and minimal winning coalitionsMonisankar Bishnu and Sonali Roy Staff General Research Papers from Iowa State University, Department of Economics Abstract: Ordinarily, the process of decision making by a committee through voting is modelled by a monotonic game the range of whose characteristic function is restricted to {0,1}. The decision rule that governs the collective action of a voting body induces a hierarchy in the set of players in terms of the a-priori influence that the players have over the decision making process. In order to determine this hierarchy in a swap robust game, one has to either evaluate a number-based power index (e.g., the Shapley-Shubik index, the Banzhaf-Coleman index) for each player or conduct a pairwise comparison between players in order to find out whether there exists a coalition in which player i is desirable over another player j as a coalition partner. In this paper we outline a much simpler and more elegant mechanism to determine the ranking of players in terms of their a-priori power using only minimal winning coalitions, rather than the entire set of winning coalitions. Keywords: Simple game; Swap robust game; Desirability; Weak desirability; Lexicographic ordering. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: http://EconPapers.repec.org/RePEc:isu:genres:13118 Access Statistics for this paper More papers in Staff General Research Papers from Iowa State University, Department of Economics |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
Swedish Business School at Örebro University.