Add to ORKGVery recently Gvozdeva, Hemaspaandra, and Slinko (2011) h ave introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of weighted voting games or roughly weighted voting games. Their third class C aconsists of all simple games permitting a weighted representation such that each winnin g coalition has a weight of at least 1 and each losing coalition a weight of at most a. We continue their work and contribute some new results on the possible values of a for a given number of voters
In many multiagent settings, situations arise in which agents must collectively make decisions while...
Weighted voting games are ubiquitous mathematical models which are used in economics, political scie...
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is ...
Very recently Gvozdeva, Hemaspaandra, and Slinko (2011) h ave introduced three hierarchies for simp...
Gvozdeva, Hemaspaandra, and Slinko (2011) have introduced three hierarchies for simple games in orde...
This project will be focused around the theory of Simple Games, weighted Voting Games will be of spe...
The final publication is available at link.springer.com via http://dx.doi.org/10.1007/s11238-017-960...
Weighted voting games are simple games that can be represented by a collection of integer weights fo...
ABSTRACT. Important decisions are likely made by groups of agents. Thus group decision making is ver...
A simple game (N, v) is given by a set N of n players and a partition of 2N into a set L of losing c...
In voting systems, game theory, switching functions, threshold logic, hypergraphs or coherent struct...
A simple game (N, v) is given by a set N of n players and a partition of 2 N into a set L of losing ...
It is well known that he influence relation orders the voters the same way as the classical Banzhaf ...
Abstract This paper contributes to the program of numerical characterization and classification of s...
The original publication is available at www.rairo-ro.orgSimple games cover voting systems in which ...
In many multiagent settings, situations arise in which agents must collectively make decisions while...
Weighted voting games are ubiquitous mathematical models which are used in economics, political scie...
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is ...
Very recently Gvozdeva, Hemaspaandra, and Slinko (2011) h ave introduced three hierarchies for simp...
Gvozdeva, Hemaspaandra, and Slinko (2011) have introduced three hierarchies for simple games in orde...
This project will be focused around the theory of Simple Games, weighted Voting Games will be of spe...
The final publication is available at link.springer.com via http://dx.doi.org/10.1007/s11238-017-960...
Weighted voting games are simple games that can be represented by a collection of integer weights fo...
ABSTRACT. Important decisions are likely made by groups of agents. Thus group decision making is ver...
A simple game (N, v) is given by a set N of n players and a partition of 2N into a set L of losing c...
In voting systems, game theory, switching functions, threshold logic, hypergraphs or coherent struct...
A simple game (N, v) is given by a set N of n players and a partition of 2 N into a set L of losing ...
It is well known that he influence relation orders the voters the same way as the classical Banzhaf ...
Abstract This paper contributes to the program of numerical characterization and classification of s...
The original publication is available at www.rairo-ro.orgSimple games cover voting systems in which ...
In many multiagent settings, situations arise in which agents must collectively make decisions while...
Weighted voting games are ubiquitous mathematical models which are used in economics, political scie...
Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is ...