Mathematical structures of simple voting games
نویسندگان
چکیده
We address simple voting games (SVGs) as mathematical objects in their own right, and study structures made up of these objects, rather than focusing on SVGs primarily as co-operative games. To this end it is convenient to employ the conceptual framework and language of category theory. This enables us to uncover the underlying unity of the basic operations involving SVGs. Mathematical Structures of Simple Voting Games
منابع مشابه
Combinatorial and computational aspects of multiple weighted voting games
Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting weight vote in favour of or against a decision. A coalition of agents is winning if and only if the sum of weights of the coalition exceeds or equals a specified...
متن کاملMonotonicity of power in weighted voting games with restricted communication
Indices that evaluate the distribution of power in simple games are commonly required to be monotonic in voting weights when the game represents a voting body such as a shareholder meeting, parliament, etc. The standard notions of local or global monotonicity are bound to be violated, however, if cooperation is restricted to coalitions that are connected by a communication graph. This paper pro...
متن کاملA Complete Geometric Representation of Four-Player Weighted Voting Systems
The relatively new weighted voting theory applies to many important organizations such as the United States Electoral College and the International Monetary Fund. Various power indexes are used to establish a relationship between weights and influence; in 1965, the Banzhaf Power Index was used to show that areas of Nassau County were unrepresented in the county legislature. It is of interest to...
متن کاملNonanonymity and sensitivity of computable simple games
This paper investigates algorithmic computability of simple games (voting games). It shows that (i) games with a finite carrier are computable, (ii) computable games have both finite winning coalitions and cofinite losing coalitions, and (iii) computable games violate any conceivable notion of anonymity, including finite anonymity and measurebased anonymity. The paper argues that computable gam...
متن کاملL S Penrose's limit theorem: Tests by simulation
L S Penrose’s Limit Theorem – which is implicit in Penrose [7, p. 72] and for which he gave no rigorous proof – says that, in simple weighted voting games, if the number of voters increases indefinitely and the relative quota is pegged, then – under certain conditions – the ratio between the voting powers of any two voters converges to the ratio between their weights. Lindner and Machover [4] p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Social Sciences
دوره 71 شماره
صفحات -
تاریخ انتشار 2014