On alpha-roughly weighted games
Document typeResearch report
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
Very 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.
CitationFreixas, J., Kurz, S. "On alpha-roughly weighted games". 2011.
URL other repositoryhttp://arxiv.org/pdf/1112.2861v1.pdf