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 …

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 …

Finding a common time slot for a group event is a daily conundrum and illustrates key
features of group decision-making. It is a complex interplay of individual incentives and …

We propose a model where voters are embedded in a social network. Each voter observes
the ballots of her neighbors in the network, from which she infers the likely outcome of the …

Classical results in social choice theory on the susceptibility of voting rules to strategic
manipulation make the assumption that the manipulator has complete information regarding …

We investigate the effect a social network could have on voting outcomes. We consider a
group of self-interested agents where each agent has a strict preference order over a set of …

Understanding the nature of strategic voting is the holy grail of social choice theory, where
game-theory, social science and recently computational approaches are all applied in order …

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 …