DeepAI
Log In Sign Up

Welfare effects of strategic voting under scoring rules

04/22/2022
by   Egor Ianovski, et al.
0

Strategic voting, or manipulation, is the process by which a voter misrepresents his preferences in an attempt to elect an outcome that he considers preferable to the outcome under sincere voting. It is generally agreed that manipulation is a negative feature of elections, and much effort has been spent on gauging the vulnerability of voting rules to manipulation. However, the question of why manipulation is actually bad is less commonly asked. One way to measure the effect of manipulation on an outcome is by comparing a numeric measure of social welfare under sincere behaviour to that in the presence of a manipulator. In this paper we conduct numeric experiments to assess the effects of manipulation on social welfare under scoring rules. We find that manipulation is usually negative, and in most cases the optimum rule with a manipulator is different to the one with sincere voters.

READ FULL TEXT VIEW PDF

page 1

page 2

page 3

page 4

10/17/2022

Sequential Elimination Voting Games

Voting by sequential elimination is a low-communication voting protocol:...
03/29/2022

Comparing the Manipulability of Approval Voting and Borda

The Gibbard-Satterthwaite theorem established that no non-trivial voting...
04/05/2012

How Many Vote Operations Are Needed to Manipulate A Voting System?

In this paper, we propose a framework to study a general class of strate...
04/01/2019

Maximization of Relative Social Welfare on Truthful Cardinal Voting Schemes

Consider the the problem of maximizing the relative social welfare of tr...
05/13/2019

Lie on the Fly: Strategic Voting in an Iterative Preference Elicitation Process

A voting center is in charge of collecting and aggregating voter prefere...
06/16/2021

Strategic Behavior is Bliss: Iterative Voting Improves Social Welfare

Recent work in iterative voting has defined the difference in social wel...
07/26/2017

Cognitive Hierarchy and Voting Manipulation

By the Gibbard--Satterthwaite theorem, every reasonable voting rule for ...

1 Introduction

In the parlance of social choice, voting is the mechanism by which a group of agents aggregate their preferences over a set of outcomes to select a single outcome for the whole of society. The language naturally brings to mind a political election – and indeed, modern voting theory traces back to the proposals of electoral reform by Borda and Condorcet in 18th century France – but the model can equally well describe the process by which a panel of judges determines the winner of a contest, a firm makes its hiring decisions, or an ensemble of algorithms comes to a joint decision.

Strategic voting is the process by which an agent casts a vote not in agreement with his true preferences, but in an attempt to attain the most preferable outcome – the standard example is a supporter of a minor third party voting for a major party closest to his ideological position. Strategic voting is also known as manipulation, a much more coloured term that is more readily associated with fraud, bribery, and other malfeasance, rather than the innocent act of not wasting one’s vote. In a political context, one could even go so far as to claim it is the democratic duty of every citizen to “manipulate” in this fashion to make his voice heard. To understand why manipulation is perceived negatively, one needs to consider the other applications of voting, those involving a small panel of experts choosing among outcomes, particularly when some outcomes are objectively “better” or “more correct” than others. In the case of a sporting event, we would certainly hope the judges rank the athletes based on their objective performance rather than personal preference (though we understand well enough that this is not always the case [27]).

The Gibbard-Satterthwaite theorem [10, 23] established that all non-trivial voting rules are vulnerable to manipulation, but that does not mean that all rules are equally vulnerable, and much attention has been focused determining that degree of vulnerability by measuring the likelihood of manipulation taking place [3, 7, 24], the complexity of finding such a manipulation [22, 11, 1], or the amount of information necessary to manipulate [6, 25, 8].

While these approaches greatly improved out understanding of how hard or how likely it is to affect the outcome of a voting rule, they said nothing about whether or not this manipulation is actually bad. In a sense, they did not have the vocabulary to do so – the twentieth century was dominated by the axiomatic approach to voting, studying which properties a voting rule does or does not satisfy, and the question of why we vote (presumably, to elect good outcomes) was rarely asked.

This was not always the case. Condorcet motivated his method as electing the objectively “correct” candidate [26], while Borda’s contemporaries observed that his method can be seen to maximise voter satisfaction [13]. This welfare approach to voting has resurfaced in recent years, and suggests a clear means to measure the effect of manipulation on voting rules – the degree to which the final social welfare of society is affected.

In this paper we numerically explore the welfare effects of strategic voting under scoring rules, focusing on the case of a small number of voters making a choice between candidates, and the final outcome being evaluated in terms of Borda, Rawls, or Nash welfare.

1.1 Related work

To our knowledge, the first authors to study the welfare effects of strategic voting were Chen and Yang [5]. In their work they consider voting in open primaries, where members of party are allowed to vote for the candidate party will nominate for the general election. Such primaries invite strategic behaviour in the form of “mischief voting” – voters of party will strive to nominate the most extreme candidate of party , to guarantee that party ’s candidate will win the final election.111“Do it. I will personally write you a campaign cheque now, on behalf of this country, which does not want you to be president, but which badly wants you to run.”
–John Oliver, on the prospect of Trump running in 2016.
The authors model the situation in a one-dimensional Hotelling framework, and consider three scenarios: all voters are sincere, only voters of party are strategic, or all voters are strategic. They find that the worst outcome in terms of social welfare is when only voters of party are strategic, but the best outcome is when all voters strategise – the effect is explained by the fact that the voters of party are motivated to vote for a more moderate candidate to counter the behaviour of the voters of party .

In a series of papers, Lehtinen uses numeric experiments to assess the welfare effects of strategic voting under sequential majority [15], Borda [14], approval voting, and plurality [16]. In his framework voters have cardinal utility over three candidates, and receive a noisy signal about the support the other candidates have. Each voter assumes the other voters are acting sincerely, and then votes in accordance with expected utility maximisation. The result is that strategic voting allows voters to express intensity of preference – a voter for whom candidate is only slightly better than is less likely to manipulate in favour of than a voter for whom

is much better. He finds that under sequential majority, Borda, and plurality utilitarian efficiency (the probability of electing the candidate maximising social welfare) increases under strategic behaviour, particularly if the correlation between the utilities of the different candidates is high. Under plurality the effect is particularly marked, the utilitarian efficiency increasing from

to as much as . The lower the correlation, the less pronounced the effect, and under approval voting there is very little difference between the sincere and strategic scenarios. In a second series of experiments the Condorcet efficiency of the rules is compared; here strategic behaviour is harmful.

Lu et al. [18] consider a setting where a group of manipulators want to elect a target candidate, but possess only partial, probabilistic knowledge of the preferences of the sincere voters. The main focus of their work is on how to compute the optimum strategy of the manipulators, but they also assess the damage the manipulators can do to social welfare, i.e. the difference in the utility derived by the sincere voters before and after manipulation. The authors train a Mallows model on Dublin West electoral data and simulate voter behaviour under the Borda rule. They find that while the probability of the manipulators being able to influence the election can be very high, the damage to social welfare is low – never more than . This is explained by the fact that a manipulation is more likely to be successful in favour of a candidate that already enjoys broad support among the sincere voters, rather than a candidate who is reviled by everyone.

Bassi [4] studied the strategic behaviour of human voters in laboratory experiments. Every game in the experiment consisted of five voters and four candidates, using one of plurality, Borda, or approval voting. The main focus of the paper was on whether humans vote as predicted by the iterated elimination of dominated strategies, thus every profile used had a dominance solution. The welfare of the outcomes was measured in terms of Condorcet efficiency and social welfare (the sum of the participants’ monetary payoffs), and compared to the theoretical prediction for sincere agents and for strategic agents playing the equilibrium solution. Plurality voting was found to outperform Borda and approval voting in terms of social welfare, but lost in terms of Condorcet efficiency.

1.2 Our contribution

We perform numeric experiments to evaluate the welfare effects of strategic voting by a small panel of voters. Our experiments cover 15 scoring rules, 3 measures of welfare, and 9 statistical cultures. Among our findings, we find that concave rules suffer the most welfare loss under manipulation, to the point that if our goal is to maximise Rawls or Nash welfare, it is rarely a good idea to use a rule that naïvely maximises said Rawls or Nash welfare; that convex rules are resistant to manipulation, which makes them more likely to elect the best outcome under a Mallows model; and that -approval performs exceedingly well under Euclidean preferences, for all the welfare measures studied.

2 Preliminaries

2.1 Voting concepts

Let , , be a set of voters, , , a set of candidates, and the set of linear orders over . Every voter is associated with some , which denotes the voter’s preferences. A profile is an -tuple of preferences, is the th component of (the preferences of voter ), and the preferences of all the other voters.

A voting rule is a mapping:

I.e., it is a rule which associates each profile with a candidate, who is the election outcome.

We are interested in a class of voting rules known as scoring rules.

Definition 1

A scoring rule is a voting rule defined by a sequence of scores, satisfying and . Using to denote the position of candidate in voter ’s ballot, the score of is:

The candidate with the highest score is the election outcome, ties are broken lexicographically.

In this paper we are interested in the following scoring rules:

  • -approval is the scoring rule with for , and for . I.e., the best candidates get one point, the rest 0. 1-approval is also known as plurality.

  • -Borda is the scoring rule with . I.e., the top candidate gets points, then , , and so on. -Borda is also known as Borda.

  • A geometric scoring rule with parameter [12], or geometric for short, is the scoring rule with if (the convex rules) and if (the concave rules). For example, with 5 candidates and

    the scoring vector is

    .

  • The Nash rule is the scoring rule with for , and .

We will evaluate the election outcomes with three ordinal welfare functions, normalised to give an outcome between 0 and 100.

Definition 2

Suppose is the election outcome. The Borda welfare of the outcome is the sum of the Borda scores of , normalised by the hypothetical Borda score of a candidate ranked first by all:

The Rawls welfare of the outcome is the Borda score given to by the voter that ranks the lowest, normalised by :

The Nash welfare of the outcome is the product of the Borda scores of , normalised by taking the th root:

Borda welfare is based on the utilitarian principle of choosing a candidate with the best average rank. Rawls welfare is based on the egalitarian notion of choosing a candidate that will minimise the misery of the unhappiest voter. Nash welfare, while originally proposed as a solution to a bargaining problem, is often proposed as a means to achieve a balance of the utilitarian and egalitarian principles [21, 19]. It should be noted that, unlike Borda and Rawls welfare, the Nash-maximising outcome depends on the choice of the zero point. In this paper, we value the last position at 0, but the performance of the voting rules with respect to Nash welfare would have differed somewhat with a different choice.

Under sincere behaviour, the Borda rule, by definition, maximises Borda welfare.

Rawls welfare is maximised by generalised antiplurality, which is not a scoring rule per se, but a generalised scoring rule – candidates are first ranked by their -approval score, first-order ties are broken by the -approval score, second-order ties by the -approval score, and so on. We do not investigate generalised antiplurality directly, but the rule is equivalent to a geometric scoring rule with a sufficiently small [12]; thus the geometric rule with is a close proxy to the Rawlsian optimum.

Given that , a candidate maximises Nash welfare if and only if it maximises the sum of the logarithms of its Borda points; this is the motivation behind the Nash rule. Unfortunately this does not give us a scoring rule because is undefined, which is why we set ; thus, no amount of first places will compensate for a single last place.

The main interest of this paper is measuring the effect of strategic voting on these measures of welfare.

Definition 3

Consider a voting rule and a profile . A strategic vote for voter is a such that:

In other words, if voter casts instead of , then the election outcome is preferable for voter .

A voter may have many strategic votes available to him. We thus define his optimal strategy to be a such that:

the operator is understood with respect to voter ’s preferences over the election outcomes.

Against this standard definition of manipulation two criticisms are often levied: 1) the probability of a single voter affecting the outcome of an election is negligibly small, and 2) it is unreasonable to suppose this voter has access to information about the other voters’ preferences, which he needs to compute his strategic vote. In the political interpretation of voting, both arguments are undoubtedly valid, and a reasonable model should account for strategic voting by groups and incomplete information, such as the model of [18] or [14]

. However, if we consider the interpretation of a small group of experts making a choice between candidates with the aim of identifying the one which is “best”, then the standard definition is reasonable enough – it would not take a great deal of social engineering to find out how one’s colleagues plan to rank interview candidates (say, ask them during a coffee break), and a single unethical judge can be enough to skew the outcome of a sporting context. Since our simulations will focus on the case where the number of voters is small and we are measuring the outcome in terms of numerical measures of welfare, we believe the standard definition of manipulation is sufficient.

2.2 Statistical cultures

We will generate voter profiles from four theoretical families. In each case, the voters are sampled i.i.d.

  • Impartial culture: given voters and candidates, each voter’s preferences are drawn uniformly at random from all possible preference orders.

  • -Euclidean: every voter and candidate is generated, uniformly at random, in , the -dimensional unit cube. A voter’s preferences are determined by Euclidean distance to the candidates – the closer the candidate, the more preferred.

  • Mallows model: given a dispersion parameter , , and a reference order , a voter is assigned a preference order with probably . is the Kendall-tau distance between and , and is a normalisation constant to make sure the probabilities add to one.

  • Mixed Mallows model: given dispersion parameters , reference orders , and probabilities , a voter is assigned a preference order with probably . That is, each defines a Mallows model, and we choose which Mallows model to sample from with the probabilities .

It should be noted that a mixed Mallows model will behave very differently depending on what reference orders are used, e.g. drawing profiles from a mixture of and will result in much more correlated preferences than a mixture of and . In this paper, when we sample from the mixed Mallows model, it is understood that the reference orders are chosen randomly for each profile sampled.

In addition to these theoretical cultures we use two cultures based on empirical data from Preflib [20]. The first, Mallows sushi, is a mixed Mallows model trained by Lu and Boutilier [17] on a dataset of 5,000 preferences over 10 sushi types (https://www.preflib.org/data/ED/00014).

The second is based on skating data, consisting of judges’ rankings of athletes in various events. The preferences in this data are highly correlated, and in most events the winner is unanimous. To deal with this we hand-picked an event with the most disagreement among the judges (https://www.preflib.org/data/ED/00006/00000046), and used a simple bag-of-preferences model (sampling the judges’ rankings with replacement).

2.3 Experimental setup

The simulations are based on varying the following parameters.

Voting rules:

  • Borda family (, , , ).

  • Approval family (, , , ).

  • Geometric family (, , , , , ).

  • Nash rule.

Theoretical cultures:

  • Impartial culture.

  • Euclidean family (1, 2, 5 dimensions).

  • Mallows family (dispersion parameters 0.8, 0.5).

  • Mixed Mallows (two equiprobable components, dispersion parameter 0.5).

Welfare measure:

  • Borda welfare.

  • Rawls welfare.

  • Nash welfare.

Voter behaviour:

  • All voters sincere.

  • Voter 1 acts optimally.

The procedure for generating welfare results is as follows:

  1. Fix . For each choice of , voting rule, theoretical culture, behaviour, and welfare measure generate 10,000 profiles, measure the welfare of the election outcome, and return the average.

  2. Fix . For each choice of , voting rule, behaviour, and welfare measure generate 10,000 profiles from the Mallows sushi culture, measure the welfare of the election outcome, and return the average.

  3. Fix . For each choice of , voting rule, behaviour, and welfare measure generate 10,000 profiles from the skating bag culture, measure the welfare of the election outcome, and return the average.

3 Results

(a) Borda welfare for IC, .
(b) Nash welfare for IC, .
(c) Borda welfare for 2-Euclidean, .
(d) Rawls welfare for 5-Euclidean, .
(e) Rawls welfare for Mallows , .
(f) Nash welfare for Mallows , .
(g) Borda welfare for sushi, .
(h) Borda welfare for skating bag, .
Figure 1: Selected plots of welfare vs number of voters/candidates.

In this section we discuss the most interesting or representative results. The results for all the studied scenarios, along with the data, code, and instructions for replication, can be found on the Github.222https://github.com/EIanovski/WelfareManipulation.

3.1 Impartial culture

Impartial culture is often seen as a worst-case for manipulation, since it increases the odds of a close election where strategic voting can make a difference. In terms of consequences on welfare, however, this turns out to be rather benign; though most scoring rules lose welfare after manipulation, Borda (and its truncated version) remains the best choice for maximising Borda welfare (

(a)), Geometric 0.5 for Rawls welfare, and Nash for Nash (at least for , after which it is overtaken by Borda. See (b)).

Nevertheless, the results with impartial culture allow us to make some general observations about the behaviour of scoring rules, which remain true in subsequent experiments.

Under sincere behaviour, concave rules expectedly do well in terms of Rawls and Nash welfare, while the Nash rule performs well in all three. However, these rules are very susceptible to manipulation, and experience the largest welfare drops. In the case of impartial culture, these drops are insufficient to dethrone the geometric rule with as the best choice for maximising Rawls welfare, but when we move on to other cultures we shall see the concave rules perform very poorly.

Convex geometric rules prove to be resistant to manipulation, and experience very minor welfare drops under strategic behaviour. However, their overall welfare properties are poor, so their stability does little to recommend them. Plurality is the most convex rule imaginable, and it is one of the few rules to consistently yield higher welfare in the presence of manipulation. However, even with the gain from manipulation, it consistently ranks as the worst rule in terms of welfare.

Borda lies on the border of convex and concave rules [12], and its properties lie between the two: loss of welfare after manipulation is tangible, but nowhere near the extent of concave rules. Though rarely the best rule in terms of welfare under manipulation, it routinely does pretty well.

5-approval and 5-Borda fare poorly, tending towards the plurality outcome as the number of candidates grows. This is unfortunate since the appeal of these rules is in their low cognitive burden on the voter, requiring the voter to rank 5 candidates rather than ; but it seems that if we value welfare, we rarely can get by without asking the voters for their full rankings. -approval and -Borda fare much better; -Borda often outperforms full Borda, while -approval is the clear winner under Euclidean preferences, to which we turn next.

3.2 Euclidean cultures

The key feature of the Euclidean cultures is the existence of a centre – candidates close to the centre of the unit cube are reasonably close to all voters, and thus tend to have high Borda, Rawls, and Nash welfare. This goes a long way to explain the outstanding performance of -approval in this setting ((c), (d)) – the centre candidates are likely to be in the top half of most voters’ ballots, and thus accumulate too many points for the manipulator to do much beyond choosing which centre candidate in particular should win.

As with impartial culture, the welfare of concave rules drops sharply under manipulation, but this time the effect is that these rules never maximise their respective welfare. Under 2- and 5-Euclidean, indeed, the Borda rule is the best choice for Rawls and Nash welfare after -approval.

The dimension of the space seems to make a difference. Under 5-Euclidean the Borda rule performs a lot better, with -Borda yielding the highest Borda welfare and Nash welfare for (Table 1). Interestingly, -approval also outperforms -approval in terms of Borda welfare.

3.3 Mallows models

The Mallows model models the situation where there is an underlying objective truth, and voter preferences are noisy signals of this true order. This noise is modelled as swaps of neighbouring candidates in the order (Kendall-tau distance), so the less swaps separate an order from the objective truth, the more likely it is to be generated. The result of this is that voter preferences are highly correlated, and as the number of candidates increases, so does the probability of the outcome being unanimous – with 100 candidates, the probability of a swap occurring at the very top of a voter’s preferences is very low. The dispersion parameter affects how soon we reach the point where all voters are likely to agree on the top candidates ((e) vs (f)).

This is where convex rules come to the fore. The extra weight they give to the top candidates allows the candidates ranked high in the objective order to accumulate an overwhelming lead, reducing the manipulator’s ability to harm social welfare. The result is that these rules are optimal at once with respect to Borda, Rawls, and Nash welfare. Concave rules, including Nash and Borda, give the manipulator enough power to bury a candidate ranked highly by the others, which harms their welfare for small values of . However as we have observed, as increases we head towards consensus, where the manipulator will have no incentive to manipulate.

The situation is different in our mixed Mallows model, which we remind the reader consists of two equiprobable components with dispersion parameters 0.5; the reference orders are sampled randomly for each profile. Convex rules again display poor welfare properties overall, while Nash and the concave geometric rules lose a lot from manipulation. The winners are members of the Borda and approval families, with -Borda and -approval performing well in terms of all welfare measures.

3.4 Mallows sushi

As another Mallows mixture, one might expect the Mallows sushi model to perform similar to our mixed Mallows model, but this is not the case. It appears that there is such a thing as the objectively best sushi (fatty tuna, for the curious), and as the number of voters increases, all voting rules converge to this result ((g)). Borda, the convex rules, and the truncated rules converge rapidly; plurality and the highly concave rules slowly; Nash the slowest of all. Manipulation is only really tangible for the highly concave rules and Nash, as it gives voters the ability to effectively veto a choice of sushi.

3.5 Skating bag

The skating bag culture is an example of a situation where there is a clear “best” candidate, who maximises at once Borda, Rawls, and Nash welfare, and all reasonable voting rules, plurality included, elect this best candidate. The damage of manipulation, therefore, measures the ability of a single voter to force through his preferred outcome in spite of overwhelming social consensus. A scoring rule needs to be top-heavy to resist this behaviour, so the high positions of the best candidate in the sincere voters’ ballots will outweigh any shenanigans by the manipulator. As plurality is the top-heavy rule par excellence, this is one of the rare situations where this rule shines ((h)). Convex geometric rules are vulnerable when the number of voters is small, but from about 10 voters onwards the sincere votes begin to outweigh the manipulator’s endeavours. The Borda rule is well-known for the scope it gives a manipulator to cause mischief, and it is only after we have 50 voters that the threat under Borda is liquidated.

Culture Borda welfare Rawls welfare Nash welfare
Impartial culture
Borda (),
-Borda
 ().
Geometric 0.5,
-approval
 ().
Borda (),
Nash (),
()-approval
1-Euclidean
Borda (),
()-approval
 ().
()-approval.
()-approval.
2-Euclidean
Borda (),
()-approval
 ().
()-approval.
()-approval.
5-Euclidean
-Borda,
()-approval
().
()-approval.
()-approval
 (),
-Borda
 ().
Mallows 0.8 Geometric 1.2.
Geometric 1.2
 (),
()-approval
 (),
Borda ().
Geometric 1.2
 (),
Nash ().
Mallows 0.5
Geometric ,
Plurality.
5-approval.
Geometric 2,
Plurality.
Mixed Mallows
-Borda,
()-approval
().
()-approval.
()-approval
 (),
()-Borda
 (),
5-approval ().
Table 1: Best scoring rules post manipulation with , . Boldface denotes rules that maximise welfare under sincere behaviour. Italics denote rules that are almost as good as the best, but much simpler.

As for concave rules, the threat never goes away. Even in an electorate of 100 voters, a single manipulator can force through a socially suboptimal outcome. A single last position does too much damage to the best candidate, giving the manipulator effective veto power over the outcome.

4 Conclusions

We summarise the three main takeaways of this study:

  • Manipulation makes a difference. With the exception of impartial culture, or profiles with a small number of candidates, the welfare-maximising rule with a manipulator is never the same as under sincere behaviour (Table 1). The effect of manipulation in our framework is almost always negative.

  • Top-heavy rules such as convex geometric rules and plurality are resistant to manipulation, losing little, or even gaining welfare in the presence of a manipulator. However, their welfare properties are so poor that this property does little to recommend them. The exception is in the case of highly correlated cultures such as Mallows models, where the additional weight these rules gives to the top candidate stymies attempts at manipulation.

  • Concave geometric rules and the Nash rule are very susceptible to manipulation, to the point that Borda or even a convex rule is often better at maximising Rawls/Nash welfare than the rules designed for that purpose. This is an issue because empirical evidence suggests that humans value a mixture of the egalitarian and utilitarian principles, and given a choice will choose a voting rule that strikes a balance between the two [2, 9, 19]. If these rules fail to deliver in the face of strategic behaviour, the question must be posed: what voting rule should a society choose, if it seeks to strike a balance between utilitarian and egalitarian principles?

References

  • [1] Aleskerov, F., Ivanov, A., Karabekyan, D., Yakuba, V.: Manipulability of aggregation procedures in impartial anonymous culture. Procedia Computer Science 55, 1250–1257 (2015)
  • [2] Ambuehl, S., Bernheim, B.D.: Interpreting the will of the people: A positive analysis of ordinal preference aggregation. Working Paper 29389, National Bureau of Economic Research (2021), http://www.nber.org/papers/w29389
  • [3] Bartholdi, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Social Choice and Welfare 6(3), 227–241 (1989)
  • [4] Bassi, A.: Voting systems and strategic manipulation: An experimental study. Journal of Theoretical Politics 27(1), 58–85 (2015)
  • [5] Chen, K.P., Yang, S.Z.: Strategic voting in open primaries. Public Choice 112(1/2), 1–30 (2002)
  • [6]

    Chopra, S., Pacuit, E., Parikh, R.: Knowledge-theoretic properties of strategic voting. In: European Workshop on Logics in Artificial Intelligence. pp. 18–30. Springer (2004)

  • [7] Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate? J. ACM 54(3), 14–es (Jun 2007)
  • [8] Conitzer, V., Walsh, T., Xia, L.: Dominating manipulations in voting with partial information. In: Twenty-Fifth AAAI Conference on Artificial Intelligence (2011)
  • [9] Frohlich, N., Oppenheimer, J.A., Eavey, C.L.: Laboratory results on Rawls’s distributive justice. British Journal of Political Science 17(1), 1–21 (1987)
  • [10] Gibbard, A.: Manipulation of voting schemes: A general result. Econometrica 41(4), 587–601 (1973)
  • [11] Kelly, J.S.: Almost all social choice rules are highly manipulable, but a few aren’t. Social choice and Welfare 10(2), 161–175 (1993)
  • [12] Kondratev, A.Y., Ianovski, E., Nesterov, A.S.: How should we score athletes and candidates: geometric scoring rules. arXiv preprint arXiv:1907.05082 (2019)
  • [13] Laplace, P.S.: Œuvres complètes, vol. 7, chap. Théorie analytique des probabilités, pp. 277–279 (1886), available at: https://gallica.bnf.fr/ark:/12148/bpt6k775950/f4
  • [14] Lehtinen, A.: The Borda rule is also intended for dishonest men. Public Choice 133(1-2), 73–90 (2007)
  • [15] Lehtinen, A.: The welfare consequences of strategic voting in two commonly used parliamentary agendas. Theory and Decision 63, 1–40 (02 2007)
  • [16] Lehtinen, A.: The welfare consequences of strategic behaviour under approval and plurality voting. European Journal of Political Economy 24, 688–704 (09 2008)
  • [17]

    Lu, T., Boutilier, C.: Effective sampling and learning for Mallows models with pairwise-preference data. Journal of Machine Learning Research

    15(117), 3963–4009 (2014)
  • [18] Lu, T., Tang, P., Procaccia, A., Boutilier, C.: Bayesian vote manipulation: Optimal strategies and impact on welfare. Uncertainty in Artificial Intelligence - Proceedings of the 28th Conference, UAI 2012 (2012)
  • [19] Masthoff, J.: Group recommender systems: Combining individual models. In: Ricci, F., Rokach, L., Shapira, B., Kantor, P.B. (eds.) Recommender Systems Handbook, pp. 677–702. Springer US, Boston, MA (2011)
  • [20] Mattei, N., Walsh, T.: Preflib: A library for preferences http://www.preflib.org. In: ADT (2013)
  • [21] Moulin, H.: Fair Division and Collective Welfare, chap. 3. Mit Press, MIT Press (2004)
  • [22] Nitzan, S.: The vulnerability of point-voting schemes to preference variation and strategic manipulation. Public choice 47(2), 349–370 (1985)
  • [23] Satterthwaite, M.A.: Strategy-proofness and arrow’s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of economic theory 10(2), 187–217 (1975)
  • [24] Walsh, T.: Where are the hard manipulation problems? J. Artif. Int. Res. 42(1), 1–29 (2011)
  • [25] Xia, L., Conitzer, V.: Determining possible and necessary winners given partial orders. Journal of Artificial Intelligence Research 41, 25–67 (2011)
  • [26] Young, H.P.: Optimal voting rules. The Journal of Economic Perspectives 9(1), 51–64 (1995)
  • [27] Zitzewitz, E.: Nationalism in winter sports judging and its lessons for organizational decision making. Journal of Economics & Management Strategy 15, 67–99 (02 2006)