Abstract.
By focusing on the protectionist tendency found in the design of voting games, a thorough analysis is provided for the role of blocking coalitions in a simple game. We characterize those blocking families that univocally determine the game, and show that otherwise at least three games share a given nonempty blocking family, also giving an upper bound for the number of such games. Some examples illustrate the application of these ideas to political science.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Carreras, F. On the design of voting games. Math Meth Oper Res 59, 503–515 (2004). https://doi.org/10.1007/s001860400344
Issue Date:
DOI: https://doi.org/10.1007/s001860400344