In judgment aggregation, unlike preference aggregation, not much is known about domain restrictions that guarantee consistent majority outcomes. We introduce several conditions on individual judgments su¢ cient for consistent majority judgments. Some are based on global orders of propositions or individuals, others on local orders, still others not on orders at all. Some generalize classic soci...

I study implementation by agenda, a straightforward voting mechanism that is widely used in practice. The main result resolves an open question which dates back to Black [1958] and Farquharson [1957/1969]. It establishes that any neutral majority voting rule which satisfies the two necessary conditions identified in prior work (McKelvey and Niemi [1978]; Moulin [1986]) as well as a significantl...

sleep stages classification is one of the most important methods for diagnosis in psychiatry and neurology. in this paper, a combination of three kinds of classifiers are proposed which classify the eeg signal into five sleep stages including awake, n-rem (non-rapid eye movement) stage 1, n-rem stage 2, n-rem stage 3 and 4 (also called slow wave sleep), and rem. twenty-five all night recordings...

We consider a situation where society decides, through majority voting in a secret ballot, between the alternatives of ‘reform’ and ‘status quo’. Reform is assumed to create a minority of winners, while being efficient in the Kaldor–Hicks sense.We explore the consequences of allowing binding transfers between voters conditional on the chosen alternative. In particular, we establish conditions u...

Individual classification models are recently challenged by combined pattern recognition systems, which often show better performance. In such systems the optimal set of classifiers is first selected and then combined by a specific fusion method. For a small number of classifiers optimal ensembles can be found exhaustively, but the burden of exponential complexity of such search limits its prac...

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...

some applications are critical and must designed Fault Tolerant System. Usually Voting Algorithm is one of the principle elements of a Fault Tolerant System. Two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. Majority confronts with the problem of threshold limits and voter of weight...