Foundation models such as GPT-4 are fine-tuned to avoid unsafe or otherwise problematic
behavior, so that, for example, they refuse to comply with requests for help with committing …

Social choice theory concerns the design and formal analysis of methods for aggregating
the preferences of multiple agents. Examples of such methods include voting procedures …

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 …

We develop a formal model of opinion polls in elections and study how they influence voting
behaviour, and thereby elections outcomes. We analyse two settings. In the first, we study a …

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 …

Most solution concepts in collective decision making are defined assuming complete
knowledge of individuals' preferences and of the mechanism used for aggregating them …

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 …

When agents are acting together, they may need a simple mechanism to decide on joint
actions. One possibility is to have the agents express their preferences in the form of a ballot …

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 …