We prove a lemma characterizing majority preferences over lotteries on a subset of Euclidean space. Assuming voters have quadratic von NeumannMorgenstern utility representations, and assuming existence of a majority undominated (or “core”) point, the core voter is decisive: one lottery is majority-preferred to another if and only if this is the preference of the core voter. Several applications...

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

A new low power dynamic CMOS one bit full adder cell is presented. In this design the time consuming XOR gates are eliminated. It is based on Majority Function. This new cell is compared with two widely used dynamic adders as well as other conventional and recently proposed architectures. It is implemented in two level dynamic CMOS with zipper technique and the number of transistors, chip area ...

The manipulation of topologically protected field configurations, already predicted and experimentally observed in non-centrosymmetric magnets, as skyrmions, merons antimerons could definitely have potential applications logic gate operations carriers information. Here, we present elaborate a proof concept on how to construct three-input non-canonical majority kagome ferromagnet lacking inversi...