Fractional approval voting is an electoral system using approval ballots (each voter selects one or more candidate alternatives), in which the outcome is fractional: for each alternative j there is a fraction pj between 0 and 1, such that the sum of pj is 1. It can be seen as a generalization of approval voting: in the latter, one candidate wins (pj = 1) and the other candidates lose (pj = 0). The fractions pj can be interpreted in various ways, depending on the setting. Examples are:

  • Time sharing: each alternative j is implemented a fraction pj of the time (e.g. each candidate j serves in office a fraction pj of the term).[1]
  • Budget distribution: each alternative j receives a fraction pj of the total budget.[2]
  • Probabilities: after the fractional results are computed, there is a lottery for selecting a single candidate, where each candidate j is elected with probability pj.[1]
  • Entitlements: the fractional results are used as entitlements (also called weights) in rules of apportionment,[3] or in algorithms of fair division with different entitlements.

Fractional approval voting is a special case of fractional social choice in which all voters have dichotomous preferences. It appears in the literature under many different terms: lottery,[1] sharing,[4] portioning,[3] mixing[5] and distribution.[2]

Formal definitions

There is a finite set C of candidates (also called: outcomes or alternatives), and a finite set N of n voters (also called: agents). Each voter i specifies a subset Ai of C, which represents the set of candidates that the voter approves.

A fractional approval voting rule takes as input the set of sets Ai, and returns as output a mixture (also called: distribution or lottery) - a vector p of real numbers in [0,1], one number for each candidate, such that the sum of numbers is 1.

It is assumed that each agent i gains a utility of 1 from each candidate in his approval set Ai, and a utility of 0 from each candidate not in Ai. Hence, agent i gains from each mixture p, a utility of . For example, if the mixture p is interpreted as a budget distribution, then the utility of i is the total budget allocated to outcomes he likes.

Desired properties

Basic properties

Two basic properties of voting rules in general, and fractional-approval-voting rules in particular, are:

  • Anonymity - the names of the voters do not matter;
  • Neutrality - the names of the candidates do not matter;

Efficiency properties

Pareto-efficiency (PE) means no mixture gives a higher utility to one agent and at least as high utility to all others.

Ex-post PE is a weaker property, relevant only for the interpretation of a mixture as a lottery. It means that, after the lottery, no outcome gives a higher utility to one agent and at least as high utility to all others (in other words, it is a mixture over PE outcomes). For example, suppose there are 5 candidates (a,b,c,d,e) and 6 voters with approval sets (ac, ad, ae, bc, bd, be). Selecting any single candidate is PE, so every lottery is ex-post PE. But the lottery selecting c,d,e with probability 1/3 each is not PE, since it gives an expected utility of 1/3 to each voter, while the lottery selecting a,b with probability 1/2 each gives an expected utility of 1/2 to each voter.

PE always implies ex-post PE. The opposite is also true in the following cases:

  • When there are at most 4 voters, or at most 3 candidates.[4]: Lem.1, 2 
  • When the candidates can be ordered on a line such that each approval set is an interval (analogously to single peaked preferences).[5]: Lemma 1 

Fairness properties

Fairness requirements are captured by variants of the notion of fair share (FS).

Individual-FS[5] (also called Fair Welfare Share[1]) means that the utility of each voter i is at least 1/n, that is, at least 1/n of the budget is allocated to candidates approved by i.

Individual-Outcome-FS[1] means that the utility of each voter i is at least his utility in a lottery that selects a candidate randomly, that is, at least k/|C|, where k is the number of candidates approved by i.

  • Individual-FS and individual-outcome-FS are insufficient since they ignore groups of voters. For example, if 99% of the voters approve X and 1% approve Y, then both properties allow to give 1/2 of the budget to X and 1/2 to Y. This is arguably unfair for the group of Y supporters.

Single-vote-FS (also called faithful[3]) means that, if each voter approves a single candidate, then the fraction assigned to each candidate j equals the number of voters who approve j divided by n.

  • Single-vote-FS is a basic requirement, but it is insufficient since it does not say anything about the case in which voters may approve two or more candidates.

Unanimous-FS[5] means that, for each set S of voters with identical preferences, the utility of each member in S is at least |S|/n.

  • Unanimous-FS implies single-vote-FS, but it is still insufficient since it does not say anything about groups of agents whose approval-sets overlap.

Group-FS[1]: 2002draft  (also callde proportional sharing[4]) means that, for each voter set S, the total budget allocated to candidates approved by at least one member of S, is at least |S|/n.

  • Group-FS implies unanimous-FS, single-vote-FS and individual-FS.
  • Group-FS is equivalent to a property called decomposability:[2] it is possible to decompose the distribution to n distributions of sum 1/n, such that the distribution recommended to agent i is positive only on candidates approved by i.

Average-FS[5] means that, for each voter set S with at least one approved candidate in common, the average utility of voters in S is at least |S|/n.

Core-FS means that, for each voter set S, there is no other distribution of their |S|/n budget, which gives all members of S a higher utility.

  • Core-FS implies Group-FS.

Strategic properties

Several variants of strategyproofness (SP) have been studied for voting rules:

  • Individual-SP means that an individual voter, who reports insincere preferences, cannot get a higher utility.
  • Weak-group-SP means that a group of voters, who report insincere preferences in coordination, cannot get a higher utility for all of them.
  • Group-SP means that a group of voters, who report insincere preferences in coordination, cannot get a higher utility for at least one of them, and at least as high utility for all of them.
  • Preference-monotonicity means that if a voter, who previously did not support a certain candidate X, starts supporting X, then the shares of the other candidates do not increase. This implies individual-SP.

A weaker variant of SP is excludable SP. It is relevant in situations where it is possible to exclude voters from using some candidate alternatives. For example, if the candidates are meeting times, then it is possible to exclude voters from participating in the meeting in times which they did not approve. This makes it harder to manipulate, and therefore, the requirement is weaker.[5]

Participation properties

Rules should encourage voters to participate in the voting process. Several participation criteria have been studied:

  • Weak participation: the utility of a voter when he participates is at least as high as his utility when he does not participate (this is the negation of the no show paradox).
  • Strict participation:[5] the utility of a voter when he participates is strictly higher than his utility when he does not participate. Particularly, a voter gains from participating even if he has "clones" - voters with identical preferences.

A stronger property is required in participatory budgeting settings in which the budget to distribute is donated by the voters themselves:

  • Pooling participation:[6] the utility of a voter when he donates through the mechanism is at least as high as his utility when he donates on his own.

Rules

Utilitarian rule

The utilitarian rule aims to maximize the sum of utilities, and therefore it distributes the entire budget among the candidates approved by the largest number of voters. In particular, if there is one candidate with the largest number of votes, then this candidate gets 1 (that is, all the budget) and the others get 0, as in single-winner approval voting. If there are some k candidates with the same largest number of votes, then the budget is distributed equally among them, giving 1/k to each such candidate and 0 to all others. The utilitarian rule has several desirable properties:[1]: Prop.1  it is anonymous, neutral, PE, individual-SP, and preference-monotone. It is also easy to compute.

However, it is not fair towards minorities - it violates Individual-FS (as well as all stronger variants of FS). For example, if 51% of the voters approve X and 49% of the voters approve Y, then the utilitarian rule gives all the budget to X and no budget at all to Y, so the 49% who vote for Y get a utility of 0. In other words, it allows for tyranny of the majority.

The utilitarian rule is also not weak-group-SP (and hence not group-SP). For example, suppose there are 3 candidates (a,b,c) and 3 voters, each of them approves a single candidate. If they vote sincerely, then the utilitarian mixture is (1/3,1/3,1/3) so each agent's utility is 1/3. If a single voter votes insincerely (say, the first one votes for both a and b), then the mixture is (0,1,0), which is worse for the insincere voter. However, if two voters collude and vote insincerely (say, the first two voters vote for the first two outcomes), then the utilitarian mixture is (1/2, 1/2, 0), which is better for both insincere voters.

Nash-optimal rule

The Nash-optimal rule maximizes the sum of logarithms of utilities. It is anonymous and neutral, and satisfies the following additional properties:

  • PE;
  • Group-FS (decomposability), Average-FS, Core-FS;[5][7]
  • Pooling participation (and strict participation);[6]
  • No other strategyproofness property (fails even excludable-SP);

The Nash-optimal rule can be computed by solving a convex program. There is another rule, called fair utilitarian, which satisfies similar properties (PE and group-FS) but is easier to compute.[1]: Thm.3 in 2002 draft 

Egalitarian rule

The egalitarian (leximin) rule maximizes the smallest utility, then the next-smallest, etc. It is anonymous and neutral, and satisfies the following additional properties:[5]

  • PE;
  • Individual-FS, but not unanimous-FS;
  • Excludable-individual-SP, but not individual-SP;
  • Weak-participation, but not strict-participation (since "clones" - voters with identical preferences - are treated as a single voter).

Other welfarist rules

For any monotonically increasing function f, one can maximize the sum of f(ui). The utilitarian rule is a special case where f(x)=x, and the Nash rule is a special case where f(x)=log(x). Every f-maximizing rule is PE, and has the following additional properties:[1]: Prop.5, 6, 7 

  • If f is any concave function of log, then it guarantees Individual-FS.
  • If-and-only-if f is the log function itself, then it guarantees group-FS and unanimous-FS (this corresponds to the Nash-optimal rule).
  • If-and-only-if f is a linear function, then it is individual-SP (this corresponds to the utilitarian rule).
  • If-and-only-if it is the utilitarian or the egalitarian rule, it satisfies excludable-SP;
  • If-and-only-if it is NOT the utilitarian nor the egalitarian rule, it satisfies strict-participation.

Priority rules

A priority rule (also called serial dictatorhip) is parametrized by a permutation of the voters, representing a priority ordering. It selects an outcome that maximizes the utility of the highest-priority agent; subject to that, maximizes the utility of the second-highest-priorty agent; and so on. Every priority rule is neutral, PE, weak-group-SP, and preference-monotone. However, it is not anonymous and does not satisfy any fairness notion.

The random priority rule selects a permutation of the voters uniformly at random, and then implements the priority rule for that permutation. It is anonymous, neutral, and satisfies the following additional properties:[1]: Prop.5 

  • Ex-post PE, but not (ex-ante) PE.
    • With the analogue of single-peaked preferences (candidates are ordered on a line and each voter approves an interval), random-priority is PE.[5]
  • Weak-group-SP.
  • Group-FS.

A disadvantage of this rule is that it is computationally-hard to find the exact probabilities (see Dictatorship mechanism#Computation).

Conditional utilitarian rule

In the conditional utilitarian rule,[5] each agent receives 1/n of the total budget. Each agent finds, among the candidates that he approves, those that are supported by the largest number of other agents, and splits his budget equally among them. It is anonymous and neutral, and satisfies the following additional properties:

  • Individual-SP;
  • Group-FS;
  • Ex-post PE but not (ex-ante) PE.
    • It is more efficient than random-priority, both in theory and in simulations.
    • It always finds a distribution that is PE among the subset of group-FS distributions.[2]

Majoritarian rule

The majoritarian rule[8] aims to concentrate as much power as possible in the hands of few candidates, while still guaranteeing fairness. It proceeds in rounds. Initially, all candidates and voters are active. In each round, the rule selects an active candidate c who is approved by the largest set of active voters, Nc. Then, the rule "assigns" these voters Nc to c, that is, it assumes that voters in Nc voted only for c, and assigns c the fraction |Nc|/n. Then, the candidate c and the voters in Nc become inactive, and the rule proceeds to the next round. Note that the conditional-utilitarian rule is similar, except that the voters in Nc do not become inactive.

The majoritarian rule is anonymous, neutral, guarantees individual-FS and single-vote-FS.

Impossibility results

Some combinations of properties cannot be attained simultaneously.

  • Ex-post PE and group-SP are incompatible (for ≥3 voters and ≥3 candidates).[1]: Prop.2 
  • Anonymity, neutrality, ex-post PE and weakly-group-SP are incompatible (for ≥4 voters and ≥6 candidates).[1]: Prop.3 
    • If we remove one of these properties, then the remaining three can be attained.
  • Ex-post PE, individual-SP and individual-outcome-FS are incompatible (for ≥3 voters and ≥3 candidates).[1]: Prop.4 
    • If we remove one of these properties, then the remaining two can be attained.
    • However, if we weaken individual-outcome-FS by allowing to give each agent only ε times his fair-outcome-share, for some ε>0, the impossibility remains.
  • Anonymity, neutrality, PE, individual-SP and individual-FS are incompatible (for ≥5 voters and ≥17 candidates).[1]: Prop.6 
    • If we remove either PE or individual-SP or individual-FS, then the remaining four properties can be attained.
    • If we remove anonymity and neutrality, the impossibility still holds, but is much harder to prove.[2]
    • In contrast, in the analogue of single-peaked preferences (candidates are ordered on a line and each voter approves an interval), all properties are attained by random-priority.
    • If we weaken individual-SP to excludable-SP, the properties are satisfied by the egalitarian rule.
    • It is open whether PE and excludable-SP are compatible with strict-participation and/or unanimous-FS.[5]
  • PE, preference-monotonicity and positive-share (a property weaker than individual-FS) are incompatible (for ≥6 voters and ≥6 candidates).[1]: Prop.7 
  • Anonymity, neutrality, PE, individual-SP and group-FS are incompatible (for ≥5 voters and ≥4 candidates).[4]
    • If we remove either PE or individual-SP or group-FS, then the remaining four properties can be attained.
    • If we remove anonymity and neutrality, the impossibility still holds, but is much harder to prove.[2]
    • When there are at most 4 voters or at most 3 candidates, a simple variant of random dictatorship attains all 5 properties: a dictator is selected at random, and the most popular outcome he likes is selected. This rule is anonymous, neutral, ex-post PE, individual-SP, Group-FS, and ex-post PE; but with at most 4 voters or at most 3 candidates, ex-post PE implies PE.
  • PE, individual-SP and positive-share are incompatible (for ≥6 voters and ≥4 candidates). This was proved with the help of a SAT Solver using 386 different profiles - probably the longest proof in social choice.[2]
    • With anonymity and neutrality as additional properties, the incompatibility holds already for ≥5 voters and ≥4 candidates, and the proof is much simpler.

Summary table

In the table below, the number in each cell represents the "strength" of the property: 0 means none (the property is not satisfied); 1 corresponds to the weak variant of the property; 2 corresponds to a stronger variant; etc.

Anon. Neut. Efficiency Fair-share Strategyproofness Participation Monotonicity Computation
0=no

1=yes

 0=no

1=yes

 0=none

1=ex-post

2=ex-ante

 0=none

0.5=positive 1=individual

2=unanimous

3=group

4=core

 0=none

1=excludable

2=individual

3=weak-group

4=group

 0=none

1=weak

2=strict

3=pooling

 0=none

1=preference

Rules

Utilitarian: 1 1 2 0 2 1 1 Polynomial
Egalitarian: 1 1 2 1 1 1 0 Polynomial
Nash: 1 1 2 4 (+average) 0 3 0 ?
Priority: 0 1 2 0 3 1 1 Polynomial
Random-priority: 1 1 1 3 3 2 (3?) 0 NP-Hard
Fair-utilitarian: 1 1 2 3 0 1 (2? 3?) 0 Polynomial
Conditional-

utilitarian

 1 1 1 3 2 (3?) 2 (3?) 1 Polynomial
Majoritarian: 1 1 ? 1 (2? 3?) ? ? ? Polynomial
Sequental-

utilitarian:[2]

 1 1 2 1? 0? 0? 1 Polynomial

Impossible combinations

n≥3, c≥3: 1 4
n≥4, c≥6 1 1 1 3
n≥3, c≥3: 1 1[outcome] 2
n≥5, c≥17: 1 1 2 2 2
n≥6, c≥6: 2 0.5 1
n≥6, c≥4: 2 0.5 2
n≥5, c≥4: 1 1 2 3 2

Open combinations

2 2 1
2 1 2

See also

References

  1. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 Bogomolnaia, Anna; Moulin, Hervé; Stong, Richard (2005-06-01). "Collective choice under dichotomous preferences" (PDF). Journal of Economic Theory. 122 (2): 165–184. doi:10.1016/j.jet.2004.05.005. ISSN 0022-0531.
  2. 1 2 3 4 5 6 7 8 Brandl, Florian; Brandt, Felix; Peters, Dominik; Stricker, Christian (2021-07-18). "Distribution Rules Under Dichotomous Preferences: Two Out of Three Ain't Bad". Proceedings of the 22nd ACM Conference on Economics and Computation. EC '21. New York, NY, USA: ACM. pp. 158–179. doi:10.1145/3465456.3467653. ISBN 9781450385541. S2CID 232109303.. A video of the EC'21 conference talk
  3. 1 2 3 Brill, Markus; Gölz, Paul; Peters, Dominik; Schmidt-Kraepelin, Ulrike; Wilker, Kai (2020-04-03). "Approval-Based Apportionment". Proceedings of the AAAI Conference on Artificial Intelligence. 34 (2): 1854–1861. arXiv:1911.08365. doi:10.1609/aaai.v34i02.5553. ISSN 2374-3468. S2CID 208158445.
  4. 1 2 3 4 Duddy, Conal (2015-01-01). "Fair sharing under dichotomous preferences". Mathematical Social Sciences. 73: 1–5. doi:10.1016/j.mathsocsci.2014.10.005. ISSN 0165-4896.
  5. 1 2 3 4 5 6 7 8 9 10 11 12 Aziz, Haris; Bogomolnaia, Anna; Moulin, Hervé (2019-06-17). "Fair Mixing: The Case of Dichotomous Preferences" (PDF). Proceedings of the 2019 ACM Conference on Economics and Computation. EC '19. Phoenix, AZ, USA: Association for Computing Machinery. pp. 753–781. doi:10.1145/3328526.3329552. ISBN 978-1-4503-6792-9. S2CID 7436482.
  6. 1 2 Brandl, Florian; Brandt, Felix; Greger, Matthias; Peters, Dominik; Stricker, Christian; Suksompong, Warut (2021-10-01). "Funding Public Projects: A Case for the Nash Product Rule". Journal of Mathematical Economics. 99: 102585. arXiv:2005.07997. doi:10.1016/j.jmateco.2021.102585. S2CID 213188260.
  7. ↑ A. Guerdjikova and K. Nehring (2014). "Weighting experts, weighting sources" (PDF).
  8. ↑ Speroni di Fenizio, Pietro; Gewurz, Daniele A. (2019-04-01). "The space of all proportional voting systems and the most majoritarian among them". Social Choice and Welfare. 52 (4): 663–683. doi:10.1007/s00355-018-1166-9. ISSN 1432-217X.
  9. ↑ Michorzewski, Marcin; Peters, Dominik; Skowron, Piotr (2020-04-03). "Price of Fairness in Budget Division and Probabilistic Social Choice". Proceedings of the AAAI Conference on Artificial Intelligence. 34 (2): 2184–2191. doi:10.1609/aaai.v34i02.5594. ISSN 2374-3468.
  10. ↑ Tang, Zhongzheng; Wang, Chenhao; Zhang, Mengqi (2020). "Price of Fairness in Budget Division for Egalitarian Social Welfare". In Wu, Weili; Zhang, Zhongnan (eds.). Combinatorial Optimization and Applications. Lecture Notes in Computer Science. Vol. 12577. Cham: Springer International Publishing. pp. 594–607. arXiv:2010.09637. doi:10.1007/978-3-030-64843-5_40. ISBN 978-3-030-64843-5. S2CID 224710712.
  11. ↑ Fain, Brandon; Goel, Ashish; Munagala, Kamesh (2016). "The Core of the Participatory Budgeting Problem". In Cai, Yang; Vetta, Adrian (eds.). Web and Internet Economics. Lecture Notes in Computer Science. Vol. 10123. Berlin, Heidelberg: Springer. pp. 384–399. arXiv:1610.03474. doi:10.1007/978-3-662-54110-4_27. ISBN 978-3-662-54110-4. S2CID 13443635.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.