Social choice becomes easier on restricted preference domains such as single-peaked,
single-crossing, and Euclidean preferences. Many impossibility theorems disappear, the …

We propose a novel model for refugee housing respecting the preferences of accepting
community and refugees themselves. In particular, we are given a topology representing the …

Borda Count is one of the earliest and most important voting rules and has been central to
many applications in artificial intelligence. We study the problem of control in Borda …

We investigate the complexity of r-Approval control problems in k-peaked elections, where at
most k peaks are allowed in each vote with respect to an order of the candidates. Our study …

We investigate the complexity of CONSTRUCTIVE CONTROL BY ADDING/DELETING
VOTES (CCAV/CCDV) for r-approval, Condorcet, Maximin, and Copeland α in k-axes and k …

We consider elections where the set of candidates is split into parties and each party can
nominate just one candidate. We study the computational complexity of two problems. The …

Stable Marriage is a fundamental problem to both computer science and economics. Four
well-known NP-hard optimization versions of this problem are the Sex-Equal Stable …

Election control encompasses attempts from an external agent to alter the structure of an
election in order to change its outcome. This problem is both a fundamental theoretical …

We study the voting problems where given is an election associated with a subset J of
candidates, and the question is whether we can modify the election in a way so that none of …

Successive and amendment are two important sequential voting procedures widely used in
parliamentary and legislative decision making. They have been extensively studied in the …