English
Related papers

Related papers: On minimum sum representations for weighted voting…

200 papers

Minority game is a model of heterogeneous players who think inductively. In this game, each player chooses one out of two alternatives every turn and those who end up in the minority side wins. It is instructive to extend the minority game…

Statistical Mechanics · Physics 2007-05-23 F. K. Chow , H. F. Chau

The new voting system of the Council of the European Union cannot be represented as the intersection of six or fewer weighted games, i.e., its dimension is at least 7. This sets a new record for real-world voting bodies. A heuristic…

Optimization and Control · Mathematics 2019-11-26 Sascha Kurz , Stefan Napel

Consider an election between k candidates in which each voter votes randomly (but not necessarily independently) and suppose that there is a single candidate that every voter prefers (in the sense that each voter is more likely to vote for…

Probability · Mathematics 2012-05-31 Joe Neeman

In this paper we first define a new kind of potential games, called coset weighted potential game, which is a generalized form of weighted potential game. Using semi-tensor product of matrices, an algebraic method is provided to verify…

Optimization and Control · Mathematics 2019-03-01 Yuanhua Wang , Daizhan Cheng

The $k$-majority game is played with $n$ numbered balls, each coloured with one of two colours. It is given that there are at least $k$ balls of the majority colour, where $k$ is a fixed integer greater than $n/2$. On each turn the player…

Combinatorics · Mathematics 2014-02-25 John R. Britnell , Mark Wildon

In this paper we address the problem of electing a committee among a set of $m$ candidates and on the basis of the preferences of a set of $n$ voters. We consider the approval voting method in which each voter can approve as many candidates…

Optimization and Control · Mathematics 2017-07-31 Diego Ponce , Justo Puerto , Federica Ricca , Andrea Scozzari

Although manipulation and bribery have been extensively studied under weighted voting, there has been almost no work done on election control under weighted voting. This is unfortunate, since weighted voting appears in many important…

Computer Science and Game Theory · Computer Science 2013-05-07 Piotr Faliszewski , Edith Hemaspaandra , Lane A. Hemaspaandra

Multiwinner voting rules are used to select a small representative subset of candidates or items from a larger set given the preferences of voters. However, if candidates have sensitive attributes such as gender or ethnicity (when selecting…

Computers and Society · Computer Science 2018-06-20 L. Elisa Celis , Lingxiao Huang , Nisheeth K. Vishnoi

There has been much recent work on multiwinner voting systems. However, sometimes a committee is highly structured, and if we want to vote for such a committee, our voting method should be more structured as well. We consider committees…

Computer Science and Game Theory · Computer Science 2022-11-14 Karl-Dieter Crisman

Weighted voting games are a well-known and useful class of succinctly representable simple games that have many real-world applications, e.g., to model collective decision-making in legislative bodies or shareholder voting. Among the…

Computer Science and Game Theory · Computer Science 2024-08-20 Joanna Kaczmarek , Jörg Rothe

Multiwinner voting rules can be used to select a fixed-size committee from a larger set of candidates. We consider approval-based committee rules, which allow voters to approve or disapprove candidates. In this setting, several voting rules…

Computer Science and Game Theory · Computer Science 2024-11-05 Dominik Peters

Voting algorithms have been widely used as consensus protocols in the realization of fault-tolerant systems. These algorithms are best suited for distributed systems of nodes with low computational power or heterogeneous networks, where…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-12-16 Sebastian Müller , Andreas Penzkofer , Darcy Camargo , Olivia Saa

We study the election control problem with multi-votes, where each voter can present a single vote according different views (or layers, we use "layer" to represent "view"). For example, according to the attributes of candidates, such as:…

Computational Complexity · Computer Science 2023-07-03 Fengbo Wang , Aizhong Zhou , Jianliang Xu

We investigate systems of indirect voting based on the law of Penrose, in which each representative in the voting body receives the number of votes (voting weight) proportional to the square root of the population he or she represents. For…

Physics and Society · Physics 2018-03-20 Wojciech Slomczynski , Karol Zyczkowski

We introduce the notion of linearly representable games. Broadly speaking, these are TU games that can be described by as many parameters as the number of players, like weighted voting games, airport games, or bankruptcy games. We show that…

Computer Science and Game Theory · Computer Science 2024-11-11 Ferenc Illés

Weighted voting games are a popular class of coalitional games that are widely used to model real-life situations of decision-making. They can be applied, for instance, to analyze legislative processes in parliaments or voting in corporate…

Computer Science and Game Theory · Computer Science 2025-08-20 Joanna Kaczmarek , Jörg Rothe

In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…

Computer Science and Game Theory · Computer Science 2019-02-25 Luis Sánchez-Fernández , Jesús A. Fisteus

Determining the power distribution of the members of a shareholder meeting or a legislative committee is a well-known problem for many applications. In some cases it turns out that power is nearly proportional to relative voting weights,…

Computer Science and Game Theory · Computer Science 2018-08-09 Sascha Kurz

In Combinatorial Game Theory, short game forms are defined recursively over all the positions the two players are allowed to move to. A form is decomposable if it can be expressed as a disjunctive sum of two forms with smaller birthday. If…

Combinatorics · Mathematics 2023-06-13 Michael Fisher , Neil A. McKay , Rebecca Milley , Richard J. Nowakowski , Carlos P. Santos

The Nakamura number of a simple game plays a critical role in preference aggregation (or multi-criterion ranking): the number of alternatives that the players can always deal with rationally is less than this number. We comprehensively…

Computer Science and Game Theory · Computer Science 2011-07-05 Masahiro Kumabe , H. Reiju Mihara