Classes of Complete Simple Games that are All Weighted

Sascha Kurz, Nikolas Tautenhahn

Abstract

Decisions are likely made by groups of agents. Transparent group aggregating rules are given by weighted voting. Here a proposal is accepted if the sum of the weights of the supporting agents meets or exceeds a given quota. We study a more general class of binary voting systems – complete simple games – and propose an algorithm to determine which sub classes, parameterized by the agent’s type composition, are weighted.

References

  1. Carreras, F. and Freixas, J. (1996). Complete simple games. Mathematical Social Sciences, 32(2):139-155.
  2. Grofman, B., Owen, G., and Feld, S. L. (1983). Thirteen theorems in search of the truth. Theory and Decision, 15(3):261-278.
  3. Isbell, J. R. (1956). A class of majority games. The Quarterly Journal of Mathematics, 7(1):183-187.
  4. Kurz, S. and Tautenhahn, N. (2013). On Dedekind's problem for complete simple games. International Journal of Game Theory, 42(2):411-437.
  5. Leech, D. (2013). Shareholder voting power and ownership control of companies. In Power, Voting, and Voting Power: 30 Years After, pages 475-498. Springer.
  6. May, K. O. (1952). A set of independent necessary and sufficient conditions for simple majority decision. Econometrica: Journal of the Econometric Society, pages 680-684.
  7. Taylor, A. D. and Zwicker, W. S. (1999). Simple games. Desirability relations, trading, pseudoweightings. Princeton University Press. 246 p.
Download


Paper Citation


in Harvard Style

Kurz S. and Tautenhahn N. (2014). Classes of Complete Simple Games that are All Weighted . In Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-017-8, pages 288-293. DOI: 10.5220/0004921902880293


in Bibtex Style

@conference{icores14,
author={Sascha Kurz and Nikolas Tautenhahn},
title={Classes of Complete Simple Games that are All Weighted},
booktitle={Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2014},
pages={288-293},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004921902880293},
isbn={978-989-758-017-8},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 3rd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Classes of Complete Simple Games that are All Weighted
SN - 978-989-758-017-8
AU - Kurz S.
AU - Tautenhahn N.
PY - 2014
SP - 288
EP - 293
DO - 10.5220/0004921902880293