Add to ORKGIn this thesis, we discuss some existing and new results relating to computational aspects of voting. In particular, we consider, apparently for the first time, the computational complexity of the application of certain types of control to the Borda count voting system. We use control in the formal sense of attempts by an election\u27s administrator to make a specific candidate win or lose by various means. We consider control problems for weighted elections, as well as for unweighted elections with voter preferences input both individually and in succinct representation
We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Bor...
In many real world situations, especially involving multiagent systems and artificial intelligence, ...
The main purpose of an election is to generate a fair end result in which everyone\u27s opinion is g...
In this thesis, we discuss some existing and new results relating to computational aspects of voting...
Standard (offline) control scenarios in elections (such as adding, deleting, or partitioning either ...
We investigate the computational complexity of electoral control in elections. Electoral control des...
AbstractVoting systems are common tools in a variety of areas. This paper studies parameterized comp...
Walsh [Wal10, Wal09], Davies et al. [DKNW10, DKNW11], and Narodytska et al. [NWX11] studied various ...
AbstractThere are different ways for an external agent to influence the outcome of an election. We c...
Electoral control refers to attempts by an election's organizer ("the chair") to influence the outco...
In the context of voting, manipulation and control refer to attempts to influence the outcome of ele...
We prove that it is NP-hard for a coalition of two manipu-lators to compute how to manipulate the Bo...
AbstractPreference aggregation in a multiagent setting is a central issue in both human and computer...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2013.The thesis of this dissert...
Voting is the archetypical form of making a collective decision. As we have seen last week, there ar...
We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Bor...
In many real world situations, especially involving multiagent systems and artificial intelligence, ...
The main purpose of an election is to generate a fair end result in which everyone\u27s opinion is g...
In this thesis, we discuss some existing and new results relating to computational aspects of voting...
Standard (offline) control scenarios in elections (such as adding, deleting, or partitioning either ...
We investigate the computational complexity of electoral control in elections. Electoral control des...
AbstractVoting systems are common tools in a variety of areas. This paper studies parameterized comp...
Walsh [Wal10, Wal09], Davies et al. [DKNW10, DKNW11], and Narodytska et al. [NWX11] studied various ...
AbstractThere are different ways for an external agent to influence the outcome of an election. We c...
Electoral control refers to attempts by an election's organizer ("the chair") to influence the outco...
In the context of voting, manipulation and control refer to attempts to influence the outcome of ele...
We prove that it is NP-hard for a coalition of two manipu-lators to compute how to manipulate the Bo...
AbstractPreference aggregation in a multiagent setting is a central issue in both human and computer...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2013.The thesis of this dissert...
Voting is the archetypical form of making a collective decision. As we have seen last week, there ar...
We prove that it is NP-hard for a coalition of two manipulators to compute how to manipulate the Bor...
In many real world situations, especially involving multiagent systems and artificial intelligence, ...
The main purpose of an election is to generate a fair end result in which everyone\u27s opinion is g...