We study minimum integer representations of weighted games, i.e. representations where the weights are integers and every other integer representation is at least as large in each component. Those minimum integer representations, if they exist at all, are linked with some solution concepts in game theory. Closing existing gaps in the literature, we prove that each weighted game with two types of voters admits a (unique) minimum integer representation, and give new examples for more than two types of voters without a minimum integer representation. We characterize the possible weights in minimum integer representations and give examples for t >= 4 types of voters without a minimum integer representation preserving types, i.e. where we additionally require that the weights are equal within equivalence classes of voters. (C) 2013 Elsevier B.V. All rights reserved.
CitationFreixas, J.; Kurz, S. On minimum integer representations of weighted games. "Mathematical social sciences", 01 Gener 2014, vol. 67, p. 9-22.
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. If you wish to make any use of the work not provided for in the law, please contact: firstname.lastname@example.org