activity
20202026
most citedSeparating and Collapsing Electoral Control Types

1 citations · 1 across the 7 of their papers we have counts for

collaborators

8 papers

cs.CC2026

Linked Fates: How Small of an Ambiguity Increase Can Make the Difference Between Equaling and Separating from P?

Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra +3

Ambiguity-bounded versions of , denoted , bound by the number of accepting paths the nondeterministic polynomial-time Turing machine ca…

cs.GT2026

Axiomatic Tools for Separating Electoral Control Types, with Applications to Concrete Systems

Michael C. Chavrimootoo, Ian Clingerman, Ethan Ferland +5

Electoral control is the study of whether an attacker, by structural changes on an election such as adding/deleting/partitioning voters or candidates, can affect the winner in some…

cs.GT2022

Search versus Search for Collapsing Electoral Control Types

Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra +3

Electoral control types are ways of trying to change the outcome of elections by altering aspects of their composition and structure [BTT92]. We say two compatible (i.e., having th…

cs.MA2022★ 1 cited

Separating and Collapsing Electoral Control Types

Benjamin Carleton, Michael C. Chavrimootoo, Lane A. Hemaspaandra +3

[HHM20] discovered, for 7 pairs (C,D) of seemingly distinct standard electoral control types, that C and D are identical: For each input I and each election system, I is a Yes inst…

math.CO2021

On Some Generalized Vertex Folkman Numbers

Zohair Raza Hassan, Yu Jiang, David E. Narváez +2

For a graph and integers , the expression means that for any -coloring of the vertices of there exists a monochromatic -…

cs.CC2021

On Lev Gordeev's "On P Versus NP"

David Narváez, Patrick Phillips

In the paper "On P versus NP," Lev Gordeev attempts to extend the method of approximation, which successfully proved exponential lower bounds for monotone circuits, to the case of…