Holistic reliability analysis of weighted voting systems from a multi-state perspective

Abstract

The computation of the reliability of weighted voting systems is an important problem in reliability theory due to its potential application in security, target identification, safety and monitoring areas. Voting systems are used in a wide variety of applications where an acceptance or rejection decision has to be made about a binary proposition presented to the system. For these systems, it is of interest to obtain the probability so that based on the vote of decision-making units, the system aggregates these votes into the right decision when presented with such a proposition. This paper presents a holistic work on weighted voting system reliability by presenting modeling, computation, estimation and optimization techniques. The modeling part takes advantage of the structure of weighted voting systems to present a model of its reliability as a multi-state system. Next, based on the multi-state view of the system, an exact computational approach based on multi-state minimal cut and path vectors is introduced. The paper then acknowledges the computational complexity of the problem and provides a Monte Carlo simulation approach that estimates system reliability accurately and in an efficient computational time. Finally, an optimization heuristic that generates quasi-optimal solutions is presented that is able to solve the problem of maximizing the reliability of a weighted voting system based on a specified number of decision-making units with known reliability characteristics.