Enviaments recents

Very recently Gvozdeva, Hemaspaandra, and Slinko (2011) h
ave introduced three hierarchies for simple games in order to measure the distance of a given simple game to the class of weighted voting games or roughly weighted ...

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 ...

This report briefly describes our generic approach to the exhaustive generation of unlabelled and labelled combinatorial classes. Our algorithms receive a size n and a finite description of a combinatorial class A using ...

In this report we combine two recent generation algorithms to obtain a
new algorithm for the generation of unlabelled cycles. Sawada's
algorithm lists all k-ary unlabelled cycles with fixed
content, that is, the
number ...

In voting systems, game theory, switching functions, threshold logic, hypergraphs or coherent structures there is an important problem that consists in determining the weightedness of a voting system by means of trades ...

This paper presents some new results about majority games. Isbell (1959) was the first to find a majority game without a minimum normalized representation; he needed 12 voters to construct such a game. Since then, it has ...

We introduce bisemivalues for bicooperative games and we also provide an interesting characterization of this kind of values by means of weighting coefficients in a similar way than given for semivalues in the context of ...

We analyze the computational complexity of the problem of deciding
whether, for a given simple game, there exists the possibility of rearranging the participants in a set of j given losing coalitions into a set of j winning ...

Binary voting systems, usually represented by simple games, constitute a main DSS topic. A crucial feature of such a system is the easiness with which a proposal can be collectively accepted, which is measured by the ...

We introduce here a family of mixed coalitional values. they extend the binomial semivalues to games endowed with a coalition structure, satisfy the property of symmetry in the quotidient game and the quotient game ...

An important consideration when applying neural networks is the sensitivity
to weights and threshold in strict separating systems representing a
linearly separable function. Two parameters have been introduced to ...