Characterization of threshold functions: state of the art, some new contributions and open problems
arXiv:1603.00329 · doi:10.1007/s11238-017-9606-z
Abstract
This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main purposes in both theories is to determine when a simple game is representable as a weighted game, which allows a very compact and easily comprehensible representation. Deep results were found in threshold logic in the sixties and seventies for this problem. However, game theory has taken the lead and some new results have been obtained for the problem in the last two decades. The second and main goal of this paper is to provide some new results on this problem and propose several open questions and conjectures for future research. The results we obtain depend on two significant parameters of the game: the number of types of equivalent players and the number of types of shift-minimal winning coalitions.
arXiv comment26 pages, 5 tables
References in corpus (6)
- On minimum sum representations for weighted voting games
- Minimal proper non-IRUP instances of the one-dimensional Cutting Stock Problem
- Dimension of the Lisbon voting rules in the EU Council: a challenge and new world record
- On minimum integer representations of weighted games
- The golden number and Fibonacci sequences in the design of voting structures
- Enumeration of weighted games with minimum and an analysis of voting power for bipartite complete games with minimum