Curtis Menton, URCS Grad Student
I am a Ph.D. student in the area of computational social choice: the
study of the computational complexity of problems relating to voting
Email: menton (at) cs.rochester.edu
Office: 617, CSB
- L. Hemaspaandra, R. Lavaee, and
C. Menton, Schulze and
Ranked-Pairs Voting Are Fixed-Parameter Tractable to Bribe,
Manipulate, and Control. To appear at AAMAS 2013.
E. Hemaspaandra, L. Hemaspaandra, and C. Menton,
Search Versus Decision for Election Manipulation Problems. To appear at STACS 2013.
C. Menton. Normalized
Range Voting Broadly Resists Control. Theory of Computing Systems.
C. Menton and
P. Singh, Manipulation and
Control Complexity of Schulze Voting. Tech report.
C. Menton and P. Singh, Manipulation Can Be Hard in Tractable Voting Systems Even for Constant-Sized Coalitions, Computer Science Review.
Summer 2012 Teaching
380, Intro to CS Theory
URCS People |
URCS Home Page