Voting method requires to determine group decision of decision by each decision maker in group. Determination of decisions by group of decision maker requires voting methods. Copeland score is one of voting method that has been developed by previous researchers. This method does not accommodate the weight of the expertise and interests of each decision maker. This paper proposed the voting meth...

We study the manipulation problem in elections with bounded singlepeaked width from the parameterized complexity point of view. In particular, we focus on the Borda, Copeland and Maximin voting correspondences. For Borda, we prove that the unweighted manipulation problem with two manipulators is fixed-parameter tractable with respect to single-peaked width. For Maximin and Copeland for every 0 ...

This paper compares binary versions of two well−known preference aggregation methods designed to overcome problems occurring from voting cycles, Copeland’s (1951) and Dodgson’s (1876) method. In particular it will first be shown that the Copeland winner can occur at any position in the Dodgson ranking. Second, it will be proved that for some list of individual preferences over the set of altern...

After we finished our sandwiches in the car, Cheryl Doby-Copeland and I quickly made way to front of museum. We figured would be among first there, so were disappointed when w...

It was proved by Champernowne [2] that the decimal . 1234567891011 . . . is normal, and by Besicovitch [11 that the same holds for the decimal . 1491625 . . . . Copeland and Erdös [3] have proved that if p i, P2 . . . . is any sequence of positive integers such that, for every 0 < 1, the number of p's up to n exceeds nB if n is sufficiently large, then the infinite decimal •p ip 2p 3 . . . is n...