In typical theoretical models of voting, all voters submit their vote at once, without an option
to change or revise their decision. While this assumption fits some political voting settings, it …

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

Multi-agent decision problems, in which independent agents have to agree on a joint plan of
action or allocation of resources, are central to artificial intelligence. In such situations …

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 …

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 …

In classical elections, voters only submit their ballot once, whereas in iterative voting, the
ballots may be changed iteratively. Following the work by Wilczynski [2019], we consider the …

We consider a set of voters making a collective decision via simultaneous vote on two binary
issues. Voters' preferences are captured by payoffs assigned to combinations of outcomes …

We propose a secure voting protocol for score-based voting rules, where independent
talliers perform the tallying procedure. The protocol outputs the winning candidate (s) while …

Voting platforms can offer participants the option to sequentially modify their preferences,
whenever they have a reason to do so. But such iterative voting may never converge …