Wikipedia

Justified representation

(Redirected from Extended justified representation)

Justified representation (JR) is a criterion of fairness in multiwinner approval voting. It can be seen as an adaptation of the proportional representation criterion to approval voting.

Background

edit

Proportional representation (PR) is an important consideration in designing electoral systems. It means that the various groups and sectors in the population should be represented in the parliament in proportion to their size. The most common system for ensuring proportional representation is the party-list system. In this system, the candidates are partitioned into parties, and each citizen votes for a single party. Each party receives a number of seats proportional to the number of citizens who voted for it. For example, for a parliament with 10 seats, if exactly 50% of the citizens vote for party A, exactly 30% vote for party B, and exactly 20% vote for party C, then proportional representation requires that the parliament contains exactly 5 candidates from party A, exactly 3 candidates from party B, and exactly 2 candidates from party C. In reality, the fractions are usually not exact, so some rounding method should be used, and this can be done by various apportionment methods.

In recent years, there is a growing dissatisfaction with the party system.[1] A viable alternative to party-list systems is letting citizens vote directly for candidates, using approval ballots. This raises a new challenge: how can we define proportional representation, when there are no pre-specified groups (parties) that can deserve proportional representation? For example, suppose one voter approves candidate 1,2,3; another voter approves candidates 2,4,5; a third voter approves candidates 1,4. What is a reasonable definition of "proportional representation" in this case?[2] Several answers have been suggested; they are collectively known as justified representation.

Basic concepts

edit

Below, we denote the number of seats by k and the number of voters by n. The Hare quota is n/k - the minimum number of supporters that justifies a single seat. In PR party-list systems, each voter-group of at least L quotas, who vote for the same party, is entitled to L representatives of that party.

A natural generalization of this idea is an L-cohesive group, defined as a group of voters with at least L quotas, who approve at least L candidates in common.

Justified representation properties

edit

Ideally, we would like to require that, for every L-cohesive group, every member must have at least L representatives. This condition, called Strong Justified Representation (SJR), might be unattainable, as shown by the following example.[3]

Example 1. There k=3 seats and 4 candidates {a,b,c,d}. There are n=12 voters with approval sets: ab, b, b, bc, c, c, cd, d, d, da, a, a. Note that the Hare quota is 4. The group {ab,b,b,bc} is 1-cohesive, as it contains 1 quota and all members approve candidate b. Strong-JR implies that candidate b must be elected. Similarly, The group {bc,c c,cd} is 1-cohesive, which requires to elect candidate c. Similarly, the group {cd,d,d,da} requires to elect d, and the group {da,a,a,ab} requires to elect a. So we need to elect 4 candidates, but the committee size is only 3. Therefore, no committee satisfies strong JR.

There are several ways to relax the notion of strong-JR.

Unanimous groups

edit

One way is to guarantee representation only to an L-unanimous group, defined as a voter group with at least L quotas, who approve exactly the same set of at least L candidates. This condition is called Unanimous Justified Representation (UJR). However, L-unanimous groups are quite rare in approval voting systems, so Unanimous-JR would not be a very useful guarantee.

Cohesive groups

edit

Remaining with L-cohesive groups, we can relax the representation guarantee as follows. Define the satisfaction of a voter as the number of winners approved by that voter. Strong-JR requires that, in every L-cohesive group, the minimum satisfaction of a group member is at least L. Instead, we can require that the average satisfaction of the group members is at least L. This weaker condition is called Average Justified Representation (AJR).[4] Unfortunately, this condition may still be unattainable. In Example 1 above, just like Strong-JR, Average-JR requires to elect all 4 candidates, but there are only 3 seats. In every committee of size 3, the average satisfaction of some 1-cohesive group is only 1/2.

  • Proportional Approval Voting guarantees each L-cohesive group, an average satisfaction larger than L-1. It has a variant called Local-Search-PAV, that runs in polynomial time, and also guarantees average satisfaction larger than L-1.[5]: Thm.1,Prop.1  This guarantee is optimal: for every constant c>0, there is no rule that guarantees average satisfaction at least L-1+c.[5]: Prop.2 
  • AJR can be satisfied by fractional committees—committees in which members can serve for a fraction of a term, or receive weighted votes. In particular, the Nash rule satisfies AJR.[6]

We can weaken the requirement further by requiring that the maximum satisfaction of a group member is at least L. In other words, in every L-cohesive group, at least one member must have L approved representatives. This condition is called Extended Justified Representation (EJR); it was introduced and analyzed by Aziz, Brill, Conitzer, Elkind, Freeman, and Walsh.[3] There is an even weaker condition, that requires EJR to hold only for L=1 (only for 1-cohesive groups); it is called Justified Representation.[3] Several known methods satisfy EJR:

  • Every committee with average-satisfaction larger than L-1 satisfies EJR (by the pigeonhole principle).[5] Hence, PAV and Local-Search-PAV satisfy EJR. PAV is the only one of Thiele's voting rules that satisfies EJR.[3]
  • The method of equal shares[7] is another polynomial-time computable rule that satisfies EJR.
  • Another polytime algorithm that guarantees EJR is EJR-Exact.[5]
  • A simple algorithm that finds an EJR allocation is called "Greedy EJR". Looping L from k downwards to 1, this algorithm checks whether there is an L-cohesive subset of voters. If so, it chooses a largest L-cohesive subset, and adds some L candidates that are approved by all of them.[8]: Algorithm 1 
  • Sequential-PAV satisfies EJR only for 1-cohesive groups, and only for k ≤ 5. For k ≥ 6, it fails EJR even for 1-cohesive groups.
  • Monroe's rule fails EJR
  • It is co-NP-complete to check whether a given committee satisfies EJR.

A further weakening of EJR is proportional justified representation (PJR). It means that, for every L ≥ 1, in every L-cohesive voter group, the union of their approval sets contains some L winners. It was introduced and analyzed by Sanchez-Fernandez, Elkind, Lackner, Fernandez, Fisteus, Val, and Skowron.[4]

  • EJR implies PJR, but not vice-versa. For example,[9]: Sec.4  consider a setting with 2k candidates and k voters. Voter i approves candidate i, as well as candidates k+1,...,2k. Note that the quota is one voter, and every L voters are an L-cohesive group. The committee 1,...,k satisfies PJR, since for every L voters, the union of their approval sets contains L winners. But it does not satisfy EJR, since every voter has only 1 approved winner. In contrast, the committee k+1,...,2k satisfies EJR.
  • PAV satisfies EJR, so it satisfies PJR too; and it is also the only weight-based approval voting rule that satisfies PJR. However, Sequential-PAV violates PJR.
  • Some of Phragmen's voting rules satisfy PJR, namely: the Leximax Phragmen - which is NP-hard to compute, and the Sequential Phragmen - which is polytime computable, and in addition, satisfies committee monotonicity. [10]
  • When k divides n, Monroe and Greedy Monroe satisfy PJR. However, when k does not divide n, both Monroe and Greedy Monroe might violate PJR, except when L=1.[4]
  • Another rule that is both PJR and polytime computable is the maximin-support rule.[11]
  • It is co-NP-complete to check whether a given committee satisfies PJR.[5]

Partially cohesive groups

edit

The above conditions have bite only for L-cohesive groups. But L-cohesive groups may be quite rare in practice.[12] The above conditions guarantee nothing at all to groups that are "almost" cohesive. This motivates the search for more robust notions of JR, that guarantee something also for partially-cohesive group.

One such notion, which is very common in cooperative game theory, is core stability (CS).[3] It means that, for any voter group with L quotas (not necessarily cohesive), if this group deviates and constructs a smaller committee with L seats, then for at least one voter, the number of committee members he approves is not larger than in the original committee. EJR can be seen as a weak variant of CS, in which only L-cohesive groups are allowed to deviate. EJR requires that, for any L-cohesive group, at least one member does not want to deviate, as his current satisfaction is already L, which is the maximum satisfaction possible with L representatives.

  • As of 2023, it is an open question whether a CS committee always exists.

Peters, Pierczyński and Skowron[13] present a different weakening of cohesivity. Given two integers L and B≤L, a group S of voters is called (L,B)-weak-cohesive if it contains at least L quotas, and there is a set C of L candidates, such that each member of S approves at least B candidates of C. Note that (L,L)-weak-cohesive is equivalent to L-cohesive. A committee satisfies Full Justified Representation (FJR) if in every (L,B)-weak-cohesive group, there is at least one members who approves some B winners. Clearly, FJR implies EJR.

  • FJR can always be satisfied by the Greedy Cohesive Rule (which is not polytime); it is open whether there are polytime algorithms satisfying FJR.

Brill and Peters[14] present a different weakening of cohesivity. Given an elected committee, define a group as L-deprived if it contains at least L quotas, and in addition, at least one non-elected candidate is approved by all members. A committee satisfies EJR+ if for every L-deprived voter group, the maximum satisfaction is at least L (at least one group member approves at least L winners); a committee satisfies PJR+ if for every L-deprived group, the union of their approval sets contains some L winners. Clearly, EJR+ implies EJR and PJR+, and PJR+ implies PJR.

  • PAV, local-search-PAV and MES satisfy EJR+; the proofs are the same as the original proofs, as the original proofs do not use cohesivity - they only use the fact that one candidate approved by all group members is not elected.
  • There is also a polytime greedy algorithm that finds an EJR+ committee: the Greedy Justified Candidate Rule.
  • PJR+ can be verified in polynomial time by reduction to submodular optimization - in contrast to PJR which is coNP-hard to verify.
  • EJR+ can be verified in polynomial time by the following simple algorithm: For every L between 1 and k, and for every unelected candidate c: count the number of voters who approve c, and approve fewer than L winners. If the number of such voters is at least L quotas, then the committee violates EJR+.
  • EJR+ satisfies a weak form of Committee monotonicity: for all k, there is an EJR+ committee W of size k, and an unelected candidate c, such that adding c to W yields an EJR+ committee (of size k+1).

Perfect representation

edit

A different, unrelated property is Perfect representation (PER). It means that there is a mapping of each voter to a single winner approved by him, such that each winner represents exactly n/k voters. While a perfect representation may not exist, we expect that, if it exists, then it will be elected by the voting rule.[4]

  • PER is compatible with PJR and JR: for every instance that admits perfect representation, there exists a committee that satisfies PJR. However, PER is not compatible with EJR: there are instances in which perfect representations exist, but none of them satisfies EJR. PER is satisfied by the Monroe rule, and by the leximax-Phragmen's rule;[10] but it is violated by Greedy Monroe, Sequential PAV, and PAV.[4]

See also: Fully proportional representation.

Implications

edit

The following diagram illustrates the implication relations between the various conditions: SJR implies AJR implies EJR; CS implies FJR implies EJR; and EJR+ implies EJR and PJR+. EJR implies PJR, which implies both UJR and JR. UJR and JR do not imply each other.

SJR → AJR → EJR → PJR → UJR
↑ ↑ → JR
CS → FJR → ↑ ↑
↑ ↑
EJR+ → ↑ → PJR+

EJR+ is incomparable to CS and to FJR.[14]: Rem.2 

PER considers only instances in which a perfect representation exists. Therefore, PER does not imply, nor implied by, any of the other axioms.

Verification

edit

Given the voters' preferences and a specific committee, can we efficiently check whether it satisfies any of these axioms?[5]

  • JR can be verified in polynomial time;
  • PJR and EJR are coNP-complete to verify;
  • PER is NP-hard to verify (deciding whether a perfect representation exists is NP-complete).

Average satisfaction - proportionality degree

edit

The satisfaction of a voter, given a certain committee, is defined as the number of committee members approved by that voter. The average satisfaction of a group of voters is the sum of their satisfaction levels, divided by the group size. If a voter-group is L-cohesive (that is, their size is at least L*n/k and they approve at least L candidates in common), then:

  • Every JR committee has an average satisfaction of at least 1 - 1/L + 1/(Ln). The same is true for every PJR committee.
  • Every EJR committee has an average satisfaction of at least (L-1)/2. Proof sketch: EJR guarantees at least one member in an L-cohesive group, a satisfaction of at least L. Once this member is removed, the remaining group is at least (L-1)-cohesive, so at least one remaining member is guaranteed a satisfaction of least L-1. Proceeding this way gives an average satisfaction of L+(L-1)+..., which is larger than (L-1)/2.
  • So, EJR provides a much stronger worst-case satisfaction guarantee than PJR.[4]
  • Every committee with an average satisfaction larger than L-1 is satisfies EJR.

Proportional Approval Voting guarantees an average satisfaction larger than L-1. It has a variant called Local-Search-PAV, that runs in polynomial time, and also guarantees average satisfaction larger than L-1 (hence it is EJR).[5]: Thm.1,Prop.1  This guarantee is optimal: for every constant c>0, there is no rule that guarantees average satisfaction at least L-1+c (see Example 1 above).[5]: Prop.2 

Skowron[15] studies the proportionality degree of multiwinner voting rules - a lower bound on the average satisfaction of all groups of a certain size.

Variable number of winners

edit

Freeman, Kahng and Pennock[16] adapt the average-satisfaction concept to multiwinner voting with a variable number of winners. They argue that the other JR axioms are not attractive with a variable number of winners, whereas average-satisfaction is a more robust notion. The adaptation involves the following changes:

  • Each voter gains satisfaction, not only from an elected candidate that he approves, but also from a non-elected candidate that he does not approve (this makes the problem similar to multi-issue voting, where each candidate is a binary issue).
  • A group is L-large if it contains at least L*n/m voters (where m is the total number of candidates), and L-cohesive if in addition the group members agree on the placement of at least L candidates (that is: the intersection of Ai plus the intersection of C\Ai is at least L).
  • A committee is r-AS (r-average-satisfaction) if for every L-cohesive group, the average of the members' satisfaction is at least r*L. The JR, PJR and EJR conditions are generalized in a similar way.
  • The PAV rule chooses a committee that maximizes the sum of Harmonic(sati), where sati is the satisfaction of voter i. The sequential Phragmen rule and the method of equal shares divide the load of each elected candidate among the voters who approve it, and the load of each unelected candidate among the voters who do not approve it. All these rules satisfy PJR. MES violates EJR; it is not known whether the other two satisfy it.
  • A deterministic rule cannot guarantee r-AS for r = (m-1)/m+epsilon, for any epsilon>0. PAV, Phragmen and MES cannot guarantee r-AS for r = 1/2+epsilon. But there is a randomized rule that satisfies (29/32)-AS.

Price of justified representation

edit

The price of justified representation is the loss in the average satisfaction due to the requirement to have a justified representation. It is analogous to the price of fairness.[8]

Empirical study

edit

Bredereck, Faliszewski, Kaczmarczyk and Niedermeier[12] conducted an experimental study to check how many committees satisfy various justified representation axioms. They find that cohesive groups are rare, and therefore a large fraction of randomly selected JR committees, also satisfy PJR and EJR.

Adaptations

edit

The justified-representation axioms have been adapted to various settings beyond simple committee voting.

Party-approval voting

edit

Brill, Golz, Peters, Schmidt-Kraepelin and Wilker adapted the JR axioms to party-approval voting. In this setting, rather than approving individual candidates, the voters need to approve whole parties. This setting is a middle ground between party-list elections, in which voters must pick a single party, and standard approval voting, in which voters can pick any set of candidates. In party-approval voting, voters can pick any set of parties, but cannot pick individual candidates within a party. Some JR axioms are adapted to this setting as follows.[17]

A voter group is called L-cohesive if it is L-large, and all group members approve at least one party in common (in contrast to the previous setting, they need not approve L parties, since it is assumed that each party contains at least L candidates, and all voters who approve the party, automatically approve all these candidates). In other words, an L-cohesive group contains L quotas of voters who agree on at least one party:

  • PJR means that, for every L ≥ 1, in every L-cohesive voter group, the parties in the union of their approval sets are allocated at least L seats.
  • EJR means that, for every integer L ≥ 1, in every L-cohesive voter group, the parties approved by at least one voter are allocated at least L seats.
  • CS means that, for any voter group of size L*n/k voters (not necessarily cohesive), if this group deviates and constructs a smaller committee with L seats, then for at least one voter, the number of committee members from parties he approves is not larger than in the original committee.

The following example[17] illustrates the difference between CS and EJR. Suppose there are 5 parties {a, b, c, d, e}, k=16 seats, and n=16 voters with the following preferences: 4*ab, 3*bc, 1*c, 4*ad, 3*de, 1*e. Consider the committee with 8 seats to party a, 4 to party c, and 4 to party e. The numbers of representatives the voters are: 8, 4, 4, 8, 4, 4. It is not CS: consider the group of 14 voters who approve ab, bc, ad, de. They can form a committee with 4 seats to party a, 5 seats to party b, and 5 seats to party d. Now, numbers of representatives are: 9, 5, [0], 9, 5, [0], so all members of the deviating coalition are strictly happier. However, the original committee satisfies EJR. Note that the quota is 1. The largest L for which an L-cohesive group exists is L=8 (the ab and ad voters), and this group is allocated 8 seats.

Rank-based elections

edit

The concept of JR originates from an earlier concept, introduced by Michael Dummett for rank-based elections. His condition is that, for every integer L ≥ 1, for every group of size at least L*n/k, if they rank the same L candidates at the top, then these L candidates must be elected.[18]

Trichotomous ballots

edit

Talmon and Page[19] extend some JR axioms from approval ballots to trichotomous (three-choice) ballots, allowing each voter to express positive, negative or neutral feelings towards each candidate. They present two classes of generalizations: stronger ("Class I") and weaker ("Class II").

They propose some voting rules tailored for trichotomous ballots, and show by simulations the extent to which their rules satisfy the adapted JR axioms.

Degressive and regressive proportionality

edit

Degressive proportionality (sometimes progressive proportionality) accords smaller groups more representatives than they are proportionally entitled to and is used by the European Parliament. For example, Penrose has suggested that each group should be represented in proportion to the square root of its size.

The extreme of degressive proportionality is diversity, which means that the committee should represent as many voters as possible. The Chamberlin-Courant (CC) voting rule aims to maximize diversity. These ideas are particularly appealing for deliberative democracy, when it is important to hear as many diverse voices as possible.

On the other end, regressive proportionality means that large groups should be given above-proportional representation. The extreme of regressive proportionality is individual excellence, which means that the committee should contain members supported by the largest number of voters.[9]: Sec.4.5  The block approval voting (AV) rule maximizes individual excellence.

Lackner and Skowron[20] show that Thiele's voting rules can be used to interpolate between regressive and degressive proportionality: PAV is proportional; rules in which the slope of the score function is above that of PAV satisfy regressive proportionality; and rules in which the slope of the score function is below that of PAV satisfy degressive proportionality. Moreover,[21] If the satisfaction-score of the i-th approved candidate is (1/p)i, for various values of p, we get the entire spectrum between CC and AV.

Jaworski and Skowron[22] constructed a class of rules that generalize the sequential Phragmén’s voting rule. Intuitively, a degressive variant is obtained by assuming that the voters who already have more representatives earn money at a slower rate than those that have fewer. Regressive proportionality is implemented by assuming that the candidates who are approved by more voters cost less than those that garnered fewer approvals.

Divisible goods

edit

Bei, Lu and Suksompong[23] extend the committee election model to a setting in which there is a continuum of candidates, represented by a real interval [0,c], as in fair cake-cutting. The goal is to select a subset of this interval, with total length at most k, where here k and c can be any real numbers with 0<k<c. To generalize the JR notions to this setting, they consider L-cohesive groups for any real number L (not necessarily an integer):[23]: App.A 

  • EJR means that, in any L-cohesive group, there is at least one agent that approves a subset of length at least L of the selected piece.
  • PJR means that, for any L-cohesive group, the union of their approval-sets contains a subset of length at least L of the selected piece.

They consider two solutions: the leximin solution satisfies neither PJR nor EJR, but it is truthful. In contrast, the Nash rule, which maximizes the sum of log(ui), satisfies EJR and hence PJR. Note that the Nash rule can be seen as a continuous analog of proportional approval voting, which maximizes the sum of Harmonic(ui). However, Nash is not truthful. The egalitarian ratio of both solutions is k/(n-nk+k).

Lu, Peters, Aziz, Bei and Suksompong[24] extend these definitions to settings with mixed divisible and indivisible candidates: there is a set of m indivisible candidates, as well as a cake [0,c]. The extended definition of EJR, which allows L-cohesive groups with non-integer L, may be unattainable. They define two relaxations:

  • EJR-M guarantees to any L-cohesive group, when there is a set of resources of total size exactly L, that at least one group member receives utility at least L. EJR-M reduces to EJR both in settings with only indivislbe candidates and in settings with only a divisible candidate.
  • EJR-b (for any real number b) guarantees to any L-cohesive group, that at least one group member receives utility larger than L-b.

They prove that:

  • For any b<1, EJR-b may be unattainable.
  • The Nash rule does not satisfy EJR-b for any b.
  • A rule called Greedy-EJR satisfies EJR-M, but runs in exponential time, and has proportionality degree ~L/2.
  • A generalization of equal shares satisfies EJR-1 but not EJR-M, but satisfies EJR for divisible-only instances, and has proportionality degree ~L/2.
  • A generalization of PAV, using an analytic extension to the harmonic series, satisfies EJR-1 but not EJR-M, does not satisfy EJR for divisible-only instances, and has proportionality degree larger than L-1.

Other adaptations

edit
  • Bulteau, Hazon, Page, Rosenfeld and Talmon[25] adapted the JR axioms to multi-issue voting (also called: perpetual voting, public decision making, or sequential decision making). Their work was later extended by Chandak, Sashwat and Peters.[26]
  • Aziz, Lee and Talmon[27] adapted the JR axioms to participatory budgeting.
  • Brill, Laslier and Skowron[28] adapted JR to degressive proportionality - assigning more weight to minorities.
  • Mavrov, Munagala and Shen[29] study the core and the JR axioms when there are constraints on the committee.
  • Munagala, Shen, Wang and Wang[30] study a multiplicative approximation of the core when agents may have non-additive satisfaction functions.

See also

edit

References

edit
  1. ^ https://www.nytimes.com/2023/09/21/us/politics/politics-discontent.html
  2. ^ Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon (2017-10-26). "Multiwinner Voting: A New Challenge for Social Choice Theory". In Endriss, Ulle (ed.). Trends in Computational Social Choice. Lulu.com. ISBN 978-1-326-91209-3.{{cite book}}: CS1 maint: multiple names: authors list (link)
  3. ^ a b c d e Aziz, Haris; Brill, Markus; Conitzer, Vincent; Elkind, Edith; Freeman, Rupert; Walsh, Toby (2017). "Justified representation in approval-based committee voting". Social Choice and Welfare. 48 (2): 461–485. arXiv:1407.8269. doi:10.1007/s00355-016-1019-3. S2CID 8564247.
  4. ^ a b c d e f Sánchez-Fernández, Luis; Elkind, Edith; Lackner, Martin; Fernández, Norberto; Fisteus, Jesús; Val, Pablo Basanta; Skowron, Piotr (2017-02-10). "Proportional Justified Representation". Proceedings of the AAAI Conference on Artificial Intelligence. 31 (1). arXiv:1611.09928. doi:10.1609/aaai.v31i1.10611. ISSN 2374-3468. S2CID 17538641.
  5. ^ a b c d e f g h Aziz, Haris; Elkind, Edith; Huang, Shenwei; Lackner, Martin; Sanchez-Fernandez, Luis; Skowron, Piotr (2018-04-25). "On the Complexity of Extended and Proportional Justified Representation". Proceedings of the AAAI Conference on Artificial Intelligence. 32 (1). doi:10.1609/aaai.v32i1.11478. ISSN 2374-3468. S2CID 19124729.
  6. ^ 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. New York, NY, USA: Association for Computing Machinery. pp. 753–781. doi:10.1145/3328526.3329552. ISBN 978-1-4503-6792-9. S2CID 7436482.
  7. ^ Grzegorz, Pierczyński; Piotr, Skowron; Dominik, Peters (2021-12-06). "Proportional Participatory Budgeting with Additive Utilities". Advances in Neural Information Processing Systems. 34. arXiv:2008.13276.
  8. ^ a b Elkind, Edith; Faliszewski, Piotr; Igarashi, Ayumi; Manurangsi, Pasin; Schmidt-Kraepelin, Ulrike; Suksompong, Warut (2024). "The Price of Justified Representation". ACM Transactions on Economics and Computation. 12 (3): 1–27. arXiv:2112.05994. doi:10.1145/3676953.
  9. ^ a b Lackner, Martin; Skowron, Piotr (2023). Multi-Winner Voting with Approval Preferences. Springer Nature. hdl:20.500.12657/60149. ISBN 978-3-031-09016-5.
  10. ^ a b Brill, Markus; Freeman, Rupert; Janson, Svante; Lackner, Martin (2023-03-06). "Phragmén's voting methods and justified representation". Mathematical Programming. 203 (1–2): 47–76. arXiv:2102.12305. doi:10.1007/s10107-023-01926-8. ISSN 1436-4646. PMC 10858002. PMID 38344413.
  11. ^ Sánchez-Fernández, Luis; Fernández, Norberto; Fisteus, Jesús A.; Brill, Markus (2018-09-05). "The Maximin Support Method: An Extension of the D'Hondt Method to Approval-Based Multiwinner Elections". arXiv:1609.05370 [cs.GT].
  12. ^ a b Bredereck, Robert; Faliszewski, Piotr; Kaczmarczyk, Andrzej; Niedermeier, Rolf (2019-08-10). "An experimental view on committees providing justified representation". Proceedings of the 28th International Joint Conference on Artificial Intelligence. IJCAI'19. Macao, China: AAAI Press: 109–115. ISBN 978-0-9992411-4-1.
  13. ^ Peters, Dominik; Pierczyński, Grzegorz; Skowron, Piotr (2021). "Proportional Participatory Budgeting with Additive Utilities". Advances in Neural Information Processing Systems. 34. Curran Associates, Inc.: 12726–12737. arXiv:2008.13276.
  14. ^ a b Brill, Markus; Peters, Jannik (2023). "Robust and Verifiable Proportionality Axioms for Multiwinner Voting". arXiv:2302.01989 [cs.GT].
  15. ^ Skowron, Piotr (2021-07-18). "Proportionality Degree of Multiwinner Rules". Proceedings of the 22nd ACM Conference on Economics and Computation. EC '21. New York, NY, USA: Association for Computing Machinery. pp. 820–840. arXiv:1810.08799. doi:10.1145/3465456.3467641. ISBN 978-1-4503-8554-1. S2CID 53046800.
  16. ^ Freeman, Rupert; Kahng, Anson; Pennock, David M. (2021-01-07). "Proportionality in approval-based elections with a variable number of winners". Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI'20. Yokohama, Yokohama, Japan: 132–138. ISBN 978-0-9992411-6-5.
  17. ^ a b 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.
  18. ^ Dummett, Michael (1984). Voting Procedures. Oxford University Press UK.
  19. ^ Talmon, Nimrod; Page, Rutvik (2021). "Proportionality in Committee Selection with Negative Feelings". arXiv:2101.01435 [cs.GT].
  20. ^ Lackner, Martin; Skowron, Piotr (2018-06-11). "Consistent Approval-Based Multi-Winner Rules". Proceedings of the 2018 ACM Conference on Economics and Computation. EC '18. New York, NY, USA: Association for Computing Machinery. pp. 47–48. arXiv:1704.02453. doi:10.1145/3219166.3219170. ISBN 978-1-4503-5829-3.
  21. ^ Lackner, Martin; Skowron, Piotr (2020-11-01). "Utilitarian welfare and representation guarantees of approval-based multiwinner rules". Artificial Intelligence. 288: 103366. arXiv:1801.01527. doi:10.1016/j.artint.2020.103366. ISSN 0004-3702.
  22. ^ Jaworski, Michal; Skowron, Piotr (2022). "Phragmén Rules for Degressive and Regressive Proportionality". arXiv:2201.04248 [cs.GT].
  23. ^ a b Bei, Xiaohui; Lu, Xinhang; Suksompong, Warut (2022-06-28). "Truthful Cake Sharing". Proceedings of the AAAI Conference on Artificial Intelligence. 36 (5): 4809–4817. arXiv:2112.05632. doi:10.1609/aaai.v36i5.20408. ISSN 2374-3468.
  24. ^ Lu, Xinhang; Peters, Jannik; Aziz, Haris; Bei, Xiaohui; Suksompong, Warut (2023-06-26). "Approval-Based Voting with Mixed Goods". Proceedings of the AAAI Conference on Artificial Intelligence. 37 (5): 5781–5788. arXiv:2211.12647. doi:10.1609/aaai.v37i5.25717. ISSN 2374-3468.
  25. ^ Bulteau, Laurent; Hazon, Noam; Page, Rutvik; Rosenfeld, Ariel; Talmon, Nimrod (2021). "Justified Representation for Perpetual Voting". IEEE Access. 9: 96598–96612. Bibcode:2021IEEEA...996598B. doi:10.1109/ACCESS.2021.3095087. ISSN 2169-3536. S2CID 235966019.
  26. ^ Chandak, Nikhil; Goel, Shashwat; Peters, Dominik (2023-06-26). "Proportional Aggregation of Preferences for Sequential Decision Making". arXiv:2306.14858 [cs.GT].
  27. ^ Aziz, Haris; Lee, Barton E.; Talmon, Nimrod (2018-07-09). "Proportionally Representative Participatory Budgeting: Axioms and Algorithms". Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems. AAMAS '18. Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems: 23–31. arXiv:1711.08226.
  28. ^ Brill, Markus; Laslier, Jean-François; Skowron, Piotr (2018-07-01). "Multiwinner approval rules as apportionment methods". Journal of Theoretical Politics. 30 (3): 358–382. arXiv:1611.08691. doi:10.1177/0951629818775518. ISSN 0951-6298. S2CID 10535322.
  29. ^ Mavrov, Ivan-Aleksandar; Munagala, Kamesh; Shen, Yiheng (2023). "Fair Multiwinner Elections with Allocation Constraints". arXiv:2305.02868 [cs.GT].
  30. ^ Munagala, Kamesh; Shen, Yiheng; Wang, Kangning; Wang, Zhiyi (2021). "Approximate Core for Committee Selection via Multilinear Extension and Market Clearing". arXiv:2110.12499 [cs.GT].
Retrieved from "https://en.wiki.x.io/w/index.php?title=Justified_representation&oldid=1259301422"