We study voting games on binary issues, where voters hold an objective over the outcome of the collective decision and are allowed, before the vote takes place, to negotiate their ballots with the other participants. We analyse the voters' rational behaviour in the resulting two-phase game when ballots are aggregated via non-manipulable rules and, more specifically, quota rules. We show under what conditions undesirable equilibria can be removed and desirable ones sustained as a consequence of the pre-vote phase
Multi-agent decision problems, in which independent agents have to agree on a joint plan of action o...
Series Frontiers in Artificial Intelligence and Applications, Volume 285In a voting system, voters m...
This paper characterizes behavior with “noisy” decision making for models of political interaction c...
We study voting games on binary issues, where voters hold an objective over the outcome of the colle...
We study voting games on binary issues, where voters hold an objective over the outcome of the colle...
We study voting games on binary issues, where voters might hold an objective over some issues at sta...
We study voting games on binary issues, where voters might hold an objective over some issues at sta...
The first part of this Thesis asks whether we can devise voting rules that allow strategic voters to...
In AI, multi-agent decision problems are of central importance, in which independent agents aggregat...
The Gibbard-Satterthwaite theorem implies the ubiquity of manipulators-voters who could change the e...
Prior research on “strategic voting” has reached the conclusion that unanimity rule is uniquely bad:...
Multi-agent decision problems, in which independent agents have to agree on a joint plan of action o...
To make collective decisions, we need good voting procedures. Suppose, through three separate polls,...
Classical results in social choice theory on the susceptibility of voting rules to strategic manipul...
[EN] In this thesis we study the multi-winner voting rules known as Proportional Approval Voting an...
Multi-agent decision problems, in which independent agents have to agree on a joint plan of action o...
Series Frontiers in Artificial Intelligence and Applications, Volume 285In a voting system, voters m...
This paper characterizes behavior with “noisy” decision making for models of political interaction c...
We study voting games on binary issues, where voters hold an objective over the outcome of the colle...
We study voting games on binary issues, where voters hold an objective over the outcome of the colle...
We study voting games on binary issues, where voters might hold an objective over some issues at sta...
We study voting games on binary issues, where voters might hold an objective over some issues at sta...
The first part of this Thesis asks whether we can devise voting rules that allow strategic voters to...
In AI, multi-agent decision problems are of central importance, in which independent agents aggregat...
The Gibbard-Satterthwaite theorem implies the ubiquity of manipulators-voters who could change the e...
Prior research on “strategic voting” has reached the conclusion that unanimity rule is uniquely bad:...
Multi-agent decision problems, in which independent agents have to agree on a joint plan of action o...
To make collective decisions, we need good voting procedures. Suppose, through three separate polls,...
Classical results in social choice theory on the susceptibility of voting rules to strategic manipul...
[EN] In this thesis we study the multi-winner voting rules known as Proportional Approval Voting an...
Multi-agent decision problems, in which independent agents have to agree on a joint plan of action o...
Series Frontiers in Artificial Intelligence and Applications, Volume 285In a voting system, voters m...
This paper characterizes behavior with “noisy” decision making for models of political interaction c...