- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
Simple Games: Desirability Relations, Trading, Pseudoweightings
Princeton University Press (1999)
Add citations
You must login to add citations.
|
|
|
Contested Pile methods are two-phase procedures for the fair allocation of indivisible items to two players. In the Generation Phase, items over which the players’ preferences differ widely enough are allocated. “Contested” items are placed in the Contested Pile, which is then allocated in the Splitting Phase. Each phase can be carried out using several different techniques; we perform a comprehensive analysis of the resulting design variants using a computational model. The properties of fairness and efficiency, generally achieved in the (...) |
|
|
We investigate under what conditions a given set of collective judgments can arise from a specific voting procedure. In order to answer this question, we introduce a language similar to modal logic for reasoning about judgment aggregation procedures. In this language, the formula expresses that is collectively accepted, or that is a group judgment based on voting. Different judgment aggregation procedures may be underlying the group decision making. Here we investigate majority voting, where holds if a majority of individuals accepts, (...) |
|
|
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 (...) |
|
|
This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main purposes in both theories is to determine when a simple game is representable as a weighted game, which allows a very compact and easily comprehensible representation. Deep results were found in threshold logic in the sixties and seventies for (...) |
|
|
We study political influence in institutions where each member chooses a level of support for a collective goal. These individual choices determine the degree to which the goal is reached. Influence is assessed by newly defined binary relations, each of which ranks members on the basis of their relative performance at a corresponding level of participation. For institutions with three options (e.g., voting games in which each voter may vote “yes”, “abstain”, or vote “no”), we obtain three influence relations, and (...) |
|
|
McGarvey (Econometrica, 21(4), 608–610, 1953) has shown that any irreflexive and anti-symmetric relation can be obtained as a relation induced by majority rule. We address the analogous issue for dominance relations of finite cooperative games with non-transferable utility (coalitional NTU games). We find any irreflexive relation over a finite set can be obtained as the dominance relation of some finite coalitional NTU game. We also show that any such dominance relation is induced by a non-cooperative game through β-effectivity. Dominance relations (...) |
|
|
Previous work by Diffo Lambo and Moulen [Theory and Decision 53, 313–325 (2002)] and Felsenthal and Machover [The Measurement of Voting Power, Edward Elgar Publishing Limited (1998)], shows that all swap preserving measures of voting power are ordinally equivalent on any swap robust simple voting game. Swap preserving measures include the Banzhaf, the Shapley–Shubik and other commonly used measures of a priori voting power. In this paper, we completely characterize the achievable hierarchies for any such measure on a swap robust (...) |
|
|
In this paper, we are concerned with the preorderings (SS) and (BC) induced in the set of players of a simple game by the ShapleyâShubik and the BanzhafâColeman's indices, respectively. Our main result is a generalization of Tomiyama's 1987 result on ordinal power equivalence in simple games; more precisely, we obtain a characterization of the simple games for which the (SS) and the (BC) preorderings coincide with the desirability preordering (T), a concept introduced by Isbell (1958), and recently reconsidered by (...) |
|
|
In this account, we explain the meaning of a priori voting power and outline how it is measured. We distinguish two intuitive notions as to what voting power means, leading to two approaches to measuring it. We discuss some philosophical and pragmatic objections, according to which a priori (as distinct from actual) voting power is worthless or inapplicable. |
|
|
Power indices are commonly required to assign at least as much power to a player endowed with some given voting weight as to any player of the same game with smaller weight. This local monotonicity and a related global property however are frequently and for good reasons violated when indices take account of a priori unions amongst subsets of players (reflecting, e.g., ideological proximity). This paper introduces adaptations of the conventional monotonicity notions that are suitable for voting games with an (...) |
|
|
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 (...) |
|
|
A Collective Identity Function (CIF) is a rule which aggregates personal opinions on whether an individual belongs to a certain identity into a social decision. A simple CIF is one which can be expressed in terms of winning coalitions. We characterize simple CIFs and explore various CIFs of the literature by exploiting their ability of being expressed in terms of winning coalitions. We also use our setting to introduce conditions that ensure the equal treatment of individuals as voters or as (...) |
|
|
A previous work by Friedman et al. (Theory and Decision, 61:305–318, 2006) introduces the concept of a hierarchy of a simple voting game and characterizes which hierarchies, induced by the desirability relation, are achievable in linear games. In this paper, we consider the problem of determining all hierarchies, conserving the ordinal equivalence between the Shapley–Shubik and the Penrose–Banzhaf–Coleman power indices, achievable in simple games. It is proved that only four hierarchies are non-achievable in simple games. Moreover, it is also proved (...) |
|
|
|
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6f5c745b77-wm7lf uwo