#### Filter Results:

#### Publication Year

2001

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this paper we propose methods to compute the Deegan-Packel, the Public Good, and the Shift power indices by generating functions for the particular case of weighted voting games. Furthermore, we define a new power index which combines the ideas of the Shift and the Deegan-Packel power indices and also propose a method to compute it with generating… (More)

An important consideration when applying neural networks is the sensitivity to weights and threshold in strict separating systems representing a linearly separable function. Perturbations may affect weights and threshold so that it is important to estimate the maximal percentage error in weights and threshold, which may be allowed without altering the… (More)

In this article, we design and analyze algorithms that solve the unranking problem (i.e., generating a combinatorial structure of size, n given its rank) for a large collection of labeled combinatorial classes, those that can be built using operators like unions (+), products (), sequences, sets, cycles, and substitutions. We also analyze the performance of… (More)

Simple games cover voting systems in which a single alternative, such as a bill or an amendment, is pitted against the status quo. A simple game or a yes–no voting system is a set of rules that specifies exactly which collections of " yea " votes yield passage of the issue at hand, each of these collections of " yea " voters forms a winning coalition. We… (More)