We study the complexity of Destructive Shift Bribery. In this problem, we are given an election with a set of candidates and a set of voters (ranking the candidates from best to worst, each), a despised candidate d (typically, one of the current winners), a budget B, and prices for shifting d down in voters’ rankings. The goal is to ensure that d is not a winner of the election. We show that th...

Complexity of voting manipulation is a prominent research topic in computational social choice. The voting manipulation literature usually assumes that the manipulator is only concerned with improving the outcome of the election from her perspective. However, in practice, the manipulator may also be reluctant to lie, i.e., she may have a preference for submitting a vote that does not deviate to...

To my parents and sister, for everything. iii ACKNOWLEDGEMENTS It is my pleasure to give my sincere thanks to all the people who have supported and helped me during the pursuit of my Ph.D. degree. Without their encouragement, I would not have completed this dissertation. First of all, I would like to express my deep gratitude to my dissertation advisor, Dr. John A. Copeland, for his constant su...

(1001) From Encoding to Retention to Recognition. MICHAEL J. WENGER & ANGELINA M. COPELAND, University of Notre Dame—The perception of meaningful, organized visual forms, such as human faces, has been hypothesized to result in an encoded representation that possesses a high degree of dependence among the constituent elements. In contrast, the perception of such forms as common objects is though...

Literacy is one of the most important life skills. Being able to read and write effectively enhances our participation in learning, personal development employment (Clendon & Erickson, 2009; Copeland Keefe, 2019). instruction cornerstone teaching New Zealand primary schools. However, not all students have equitable access rich literacy (Kliewer et al., 2006). Research field indicates that w...

A ranking method assigns to every directed graph a (weak) ordering of the nodes. In this paper, we axiomatize the ranking method that ranks the nodes according to their outdegree. This method generalizes the ranking by Copeland score for tournaments as characterized in Rubinstein (SIAM J. Appl. Math. 38 (1980) 108–111). c © 2003 Elsevier B.V. All rights reserved.