The Internet enables computers and (by proxy) humans to communicate at distances and
speeds previously unimaginable. Many of the benefits from this technology are derived from …

We suggest a new model for strategic voting based on local dominance, where voters
consider a set of possible outcomes without assigning probabilities to them. We prove that …

Social choice theory deals with aggregating the preferences of multiple individuals
regarding several available alternatives, a situation colloquially known as voting. There are …

We study convergence properties of iterative voting procedures. Such procedures are
defined by a voting rule and a (restricted) iterative process, where at each step one agent …

Computational social choice is a research area at the intersection of computer science,
mathematics, and economics that is concerned with aggregation of preferences of multiple …

We study a game-theoretic model for Plurality, one of the most well-studied and widely-used
voting rules. It is well known that the most standard game-theoretic approaches can be …

Following recent studies of iterative voting and its effects on plurality vote outcomes, we
provide characterisations and complexity results for three models of iterative voting under …

Recent work in iterative voting has defined the additive dynamic price of anarchy (ADPoA)
as the difference in social welfare between the truthful and worst-case equilibrium profiles …

District-based manipulation, or gerrymandering, is usually taken to refer to agents who are in
fixed location, and an external division is imposed upon them. However, in many real-world …

Iterative voting is a social choice mechanism whereby voters are allowed to continually
make strategic changes to their stated preferences until no further change is desired. We …