Determining possible and necessary winners given partial orders
L Xia, V Conitzer - Journal of Artificial Intelligence Research, 2011 - jair.org
Usually a voting rule requires agents to give their preferences as linear orders. However, in
some cases it is impractical for an agent to give a linear order over all the alternatives. It has …
some cases it is impractical for an agent to give a linear order over all the alternatives. It has …
[图书][B] Economics and computation
J Rothe - 2015 - Springer
1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …
supporting her as a junior professor for Computational Social Choice and by the project …
Strategic behavior in judgment aggregation
Collective decision making is concerned with aggregating information reported by a number
of individuals into a collective decision appropriately capturing the individual views as a …
of individuals into a collective decision appropriately capturing the individual views as a …
Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules
Abstract Endriss et al.(2012) initiated the complexity-theoretic study of problems related to
judgment aggregation. We extend their results on the manipulation of two specific judgment …
judgment aggregation. We extend their results on the manipulation of two specific judgment …
Cloning in elections: Finding the possible winners
We consider the problem of manipulating elections by cloning candidates. In our model, a
manipulator can replace each candidate c by several clones, ie, new candidates that are so …
manipulator can replace each candidate c by several clones, ie, new candidates that are so …
Large-scale election campaigns: Combinatorial shift bribery
We study the complexity of a combinatorial variant of the SHIFT BRIBERY problem in
elections. In the standard SHIFT BRIBERY problem, we are given an election where each …
elections. In the standard SHIFT BRIBERY problem, we are given an election where each …
Algorithms for destructive shift bribery
A Kaczmarczyk, P Faliszewski - Autonomous Agents and Multi-Agent …, 2019 - Springer
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 (each ranking the candidates from the …
election with a set of candidates and a set of voters (each ranking the candidates from the …
Multiwinner rules with variable number of winners
We consider voting rules for approval-based elections that select committees whose size is
not predetermined. Unlike the study of rules that output committees with a predetermined …
not predetermined. Unlike the study of rules that output committees with a predetermined …
The complexity of bribery and control in group identification
The goal of this paper is to analyze the complexity of constructive/destructive bribery and
destructive control in the framework of group identification. Group identification applies to …
destructive control in the framework of group identification. Group identification applies to …
On the complexity of bribery and manipulation in tournaments with uncertain information
We study the computational complexity of bribery and manipulation schemes for sports
tournaments with uncertain information. We introduce a general probabilistic model for multi …
tournaments with uncertain information. We introduce a general probabilistic model for multi …