Skip to main content
Erschienen in: Public Choice 1-2/2013

01.10.2013

Elections with partially ordered preferences

verfasst von: Michael Ackerman, Sul-Young Choi, Peter Coughlin, Eric Gottlieb, Japheth Wood

Erschienen in: Public Choice | Ausgabe 1-2/2013

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Suppose an organization has a committee with multiple seats, and the committee members are to be elected by a group of voters. For the organization, the possible alternatives are the possible sets of individuals who could serve together. A common approach is to choose from among these alternatives by having each voter cast separate votes on the candidates for each seat. When this type of ballot is used, important characteristics of the set of individuals on the committee (such as what percentage of the members will be female) might not be explicitly considered by the voters. Another approach that has been used is to have each voter cast a ballot which ranks all possible sets of members. However, this approach can require the voters to weigh a relatively large number of alternatives. This paper considers group decisions where it is desirable to: (1) explicitly consider characteristics of alternatives and (2) have a relatively small number of options upon which a voter has to express his preferences. The approach that we propose has two steps: First voters vote directly on pertinent characteristics of alternatives; Then these votes are used to indirectly specify preferences on alternatives. The indirectly specified preferences are ones that are naturally modeled using partially ordered sets. We identify some specific methods that could be applied in the second step. In addition, by replacing the indirectly specified preferences in a suitable way, we suggest a technique that can use any positional, pairwise, or other voting method that accepts totally (or “completely”) ordered inputs to tally ballots. We also describe another way to potentially compute pairwise rankings from partially ordered alternatives and discuss some practical and theoretical difficulties associated with our approach.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
Our proposal has some features that are also present in the following description from Bassett and Persky (1994: 1076) of a method that has been used to obtain placements in an “original program” event at skating competitions: “a judge gives two cardinal marks … for required elements and presentation”; “for each judge an ordinal ranking of skaters is determined from total marks, the sum of the two subcomponent cardinal scores. These ordinal ranks and not the raw scores become the basis for determining placements”. The common features are: (1) there is more than one stage and (2) the last stage aggregates derived orderings on the alternatives. However, the stages that come before the last stage differ. Each characteristic we consider is one where it is known whether it is present or absent in a particular alternative. In our proposal, a voter initially expresses his preferences on such characteristics and those preferences on characteristics are used to obtain his derived ordering on the alternatives. Alternatively, at the skating competition, a judge initially evaluates the extent to which a skater exhibits certain characteristics and those evaluations are used to obtain his derived ordering. For a survey of other methods that use individuals’ judgements about characteristics of alternatives as inputs for group decision making, see Bose et al. (1997).
 
2
The mathematical properties of posets have been studied in great depth and breadth. See, for instance, Stanley (1997).
 
3
Our formulation of the basic features of a voter’s derived preferences on alternatives matches with “preference structures” as described in Sects. 2.1–2.3 of Roubens and Vincke (1985). Our formulation of the commonly used approach of using totally ordered sets to represent voter preferences in situations where no two distinct alternatives are equivalent matches with “total order structures” as described in Sect. 3.2 of Roubens and Vincke (1985). Our approach for situations where there are no v, S, and T so that S v T and where S v T for some v, S, and T matches with “partial order structures” as described in Sect. 3.6 of Roubens and Vincke (1985).
 
4
In a strict partial order, if \(S, T \in\mathcal{P}\) and if S<T, then not(T<S). Hence, a strict partial order vacuously satisfies the antisymmetry property.
 
5
Because of the way that indifference is defined, this approach implicitly assumes that the preference relation “is as at least as good as” satisfies reflexivity and completeness.
 
6
In Theorem 2.2 of Aleskerov and Monjardet (2002: 26), it is proved that < is a strict bucket order on \(\mathcal{P}\) if and only if < satisfies
1.
For all \(S, T \in\mathcal{P}\), if S<T, then \(T \not< S\) (asymmetry).
 
2.
For all \(R, S, T \in\mathcal{P}\), if \(R \not< S\) and \(S \not< T\), then \(R \not< T\) (negative transitivity).
 
The term “weak order” has been used for a strict bucket order in some references where this alternative formulation appears; see, for instance, Fishburn (1973b: 75; 1973a: 460), Fishburn and Gehrlein (1975: 93), Aleskerov and Monjardet (2002: 22). If an individual’s strict preferences are a strict bucket order and the “alternative approach” to modeling preferences (described in the previous section) is used, then the preference relation “is as at least as good as” is transitive, complete, and reflexive (see, for instance, the first line after Eq. (7.6) in Fishburn (1973b: 76). In some references, the term “weak order” and the closely related term “weak ordering” have (alternatively) been used for such preference relations (that is, ones which are transitive, complete, and reflexive)—see, for instance, Arrow (1963: 12), Sect. 3.6 of Roubens and Vincke (1985), or Merlin and Valognes (2004: 344). In what follows, we will not use the term “weak order” for a strict bucket order—in order to keep readers from mistakenly thinking that we are referring to preference relations that are transitive, complete, and reflexive.
 
7
There are, of course, various other issues about which voters might be concerned. For example, there may be two candidates who voters believe would serve well (or poorly) on the committee together. For some other specific examples of issues about which voters might wish to have input, see Ratliff (2006: 351).
 
8
Antisymmetry and transitivity prohibit cycles of more than one element in posets. Directed graphs, a.k.a. digraphs, with multiple or weighted edges would be a more appropriate model for such an approach. See, e.g., Bondy and Murty (1976) for more on digraphs.
 
9
The interpretation of preference digraphs has been explored in the context of pairwise voting (see Taylor (1968) or Reid (2004), for example).
 
10
By a subposet of a poset (P, ≤ P ) we mean a subset Q of P together with a partial order ≤ Q on Q such that, for all x,yQ, x Q y if and only if x P y.
 
11
The basic idea behind the linear extension method is similar to that of the simple Copeland (1951) method, a more than half-century old voting procedure based on pairwise comparisons. By considering linear extensions for each preference poset, the linear extension method incorporates the magnitude of pairwise comparisons, lack of which was a major argument against the simple Copeland method by Merlin and Saari (1996, 1997).
 
12
This property does not hold for all voting methods. See Fishburn (1977) for example.
 
13
For a given poset (P, ≤ P ), the poset (P, \(\leq_{P}'\)) where \(\leq_{P}'= \{(x,y):(y,x) \in\, \leq_{P}\}\) is called the dual of (P, ≤ P ). Using this terminology, this step can be described more precisely as obtaining the duals of the posets under consideration.
 
14
Reversing a poset can change the definition of a concept that depends on its order. For such a concept, a second definition that is obtained by reversing all of the comparisons in the poset is called its dual concept. For instance, for a poset, upper bound is the dual concept of lower bound. Analogously, reversing a list of preference posets can change the definition of a concept that depends on their orders. For such a concept, a second definition that is obtained by reversing all of the comparisons in the posets can (similarly) be called its dual concept. The result that we’ve stated is based on the observation that, for a list of preference posets, Condorcet winner is the dual concept of Condorcet loser when the pairwise linear extensions method is being used.
 
15
For some specific metrics that could be used to measure “closeness”, see Fagin et al. (2004, 2006).
 
16
Whereas NP-complete problems ask a yes/no question, #P-complete problems (pronounced “sharp-P”) are the functional analogue. A number must be determined, such as how many linear extensions of a poset there are.
 
Literatur
Zurück zum Zitat Aleskerov, F., & Monjardet, B. (2002). Utility maximization, choice, and preference. Berlin: Springer-Verlag. CrossRef Aleskerov, F., & Monjardet, B. (2002). Utility maximization, choice, and preference. Berlin: Springer-Verlag. CrossRef
Zurück zum Zitat Arrow, K. (1963). Social choice and individual values (2nd edn.). New Haven: Yale University Press. Arrow, K. (1963). Social choice and individual values (2nd edn.). New Haven: Yale University Press.
Zurück zum Zitat Bassett, G., & Persky, J. (1994). Rating skating. Journal of the American Statistical Association, 89, 1075–1079. CrossRef Bassett, G., & Persky, J. (1994). Rating skating. Journal of the American Statistical Association, 89, 1075–1079. CrossRef
Zurück zum Zitat Bassett, G., & Persky, J. (1999). Robust voting. Public Choice, 99, 299–310. CrossRef Bassett, G., & Persky, J. (1999). Robust voting. Public Choice, 99, 299–310. CrossRef
Zurück zum Zitat Black, D. (1976). Partial justification of the Borda count. Public Choice, 28, 1–15. CrossRef Black, D. (1976). Partial justification of the Borda count. Public Choice, 28, 1–15. CrossRef
Zurück zum Zitat Bondy, J. A., & Murty, U. S. R. (1976). Graph theory with applications. Amsterdam: North-Holland. Bondy, J. A., & Murty, U. S. R. (1976). Graph theory with applications. Amsterdam: North-Holland.
Zurück zum Zitat Bose, U., Davey, A., & Olson, D. (1997). Multi-attribute utility methods in group decision making. Omega, 25, 691–706. CrossRef Bose, U., Davey, A., & Olson, D. (1997). Multi-attribute utility methods in group decision making. Omega, 25, 691–706. CrossRef
Zurück zum Zitat Brams, S. (1990). Constrained approval voting: a voting system to elect a governing board. Interfaces, 20, 67–79. CrossRef Brams, S. (1990). Constrained approval voting: a voting system to elect a governing board. Interfaces, 20, 67–79. CrossRef
Zurück zum Zitat Brams, S. (2008). Mathematics and democracy. Princeton: Princeton University Press. Brams, S. (2008). Mathematics and democracy. Princeton: Princeton University Press.
Zurück zum Zitat Brightwell, G., & Winkler, P. (1991). Counting linear extensions. Order, 8, 225–242. CrossRef Brightwell, G., & Winkler, P. (1991). Counting linear extensions. Order, 8, 225–242. CrossRef
Zurück zum Zitat Copeland, A. (1951). A “reasonable” social welfare function. Mimeographed notes. Seminar on Applications of Mathematics to the Social Sciences. University of Michigan. Copeland, A. (1951). A “reasonable” social welfare function. Mimeographed notes. Seminar on Applications of Mathematics to the Social Sciences. University of Michigan.
Zurück zum Zitat Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., & Vee, E. (2004). Comparing and aggregating rankings with ties. In Proceedings of the 2004 ACM Symposium on Principles of Database Systems (pp. 47–58). Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., & Vee, E. (2004). Comparing and aggregating rankings with ties. In Proceedings of the 2004 ACM Symposium on Principles of Database Systems (pp. 47–58).
Zurück zum Zitat Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., & Vee, E. (2006). Comparing partial rankings. SIAM Journal on Discrete Mathematics, 20, 628–648. CrossRef Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., & Vee, E. (2006). Comparing partial rankings. SIAM Journal on Discrete Mathematics, 20, 628–648. CrossRef
Zurück zum Zitat Fishburn, P. C. (1973a). On the construction of weak orders from fragmentary information. Psychometrika, 38, 459–472. CrossRef Fishburn, P. C. (1973a). On the construction of weak orders from fragmentary information. Psychometrika, 38, 459–472. CrossRef
Zurück zum Zitat Fishburn, P. C. (1973b). The theory of social choice. Princeton: Princeton University Press. Fishburn, P. C. (1973b). The theory of social choice. Princeton: Princeton University Press.
Zurück zum Zitat Fishburn, P. C. (1977). Condorcet social choice functions. SIAM Journal of Applied Mathematics, 33, 469–489. CrossRef Fishburn, P. C. (1977). Condorcet social choice functions. SIAM Journal of Applied Mathematics, 33, 469–489. CrossRef
Zurück zum Zitat Fishburn, P. C., & Brams, S. (1993). Yes-no voting. Social Choice and Welfare, 10, 35–50. Fishburn, P. C., & Brams, S. (1993). Yes-no voting. Social Choice and Welfare, 10, 35–50.
Zurück zum Zitat Fishburn, P. C., & Gehrlein, W. V. (1975). A comparative analysis of methods for constructing weak orders from partial orders. Journal of Mathematical Sociology, 4, 93–102. CrossRef Fishburn, P. C., & Gehrlein, W. V. (1975). A comparative analysis of methods for constructing weak orders from partial orders. Journal of Mathematical Sociology, 4, 93–102. CrossRef
Zurück zum Zitat Huber, M. (2006). Fast perfect sampling from linear extensions. Discrete Mathematics, 306, 420–428. CrossRef Huber, M. (2006). Fast perfect sampling from linear extensions. Discrete Mathematics, 306, 420–428. CrossRef
Zurück zum Zitat Kadane, J. (1972). On division of the question. Public Choice, 13, 47–54. CrossRef Kadane, J. (1972). On division of the question. Public Choice, 13, 47–54. CrossRef
Zurück zum Zitat Merlin, V., & Saari, D. (1996). The Copeland method. i. Relationships and the dictionary. Journal of Economic Theory, 8, 51–76. Merlin, V., & Saari, D. (1996). The Copeland method. i. Relationships and the dictionary. Journal of Economic Theory, 8, 51–76.
Zurück zum Zitat Merlin, V., & Saari, D. (1997). The Copeland method. ii. Manipulation, monotonicity, and paradoxes. Journal of Economic Theory, 72, 148–172. CrossRef Merlin, V., & Saari, D. (1997). The Copeland method. ii. Manipulation, monotonicity, and paradoxes. Journal of Economic Theory, 72, 148–172. CrossRef
Zurück zum Zitat Merlin, V., & Valognes, F. (2004). The impact of indifferent voters on the likelihood of some voting paradoxes. Mathematical Social Sciences, 48, 343–361. CrossRef Merlin, V., & Valognes, F. (2004). The impact of indifferent voters on the likelihood of some voting paradoxes. Mathematical Social Sciences, 48, 343–361. CrossRef
Zurück zum Zitat Ratliff, T. C. (2006). Selecting committees. Public Choice, 126, 343–355. CrossRef Ratliff, T. C. (2006). Selecting committees. Public Choice, 126, 343–355. CrossRef
Zurück zum Zitat Reid, K. B. (2004). Tournaments. In J. L. Gross & J. Yellen (Eds.), Handbook of graph theory (pp. 156–184). Boca Raton: CRC Press. Reid, K. B. (2004). Tournaments. In J. L. Gross & J. Yellen (Eds.), Handbook of graph theory (pp. 156–184). Boca Raton: CRC Press.
Zurück zum Zitat Roubens, M., & Vincke, P. (1985). Preference modelling. Berlin: Springer. CrossRef Roubens, M., & Vincke, P. (1985). Preference modelling. Berlin: Springer. CrossRef
Zurück zum Zitat Saari, D. (2000). Chaotic elections. Providence: American Mathematical Society. Saari, D. (2000). Chaotic elections. Providence: American Mathematical Society.
Zurück zum Zitat Saari, D. (2001). Decisions and elections. Cambridge: Cambridge University Press. CrossRef Saari, D. (2001). Decisions and elections. Cambridge: Cambridge University Press. CrossRef
Zurück zum Zitat Stanley, R. P. (1997). Enumerative combinatorics (Vol. 1). Cambridge: Cambridge University Press. CrossRef Stanley, R. P. (1997). Enumerative combinatorics (Vol. 1). Cambridge: Cambridge University Press. CrossRef
Zurück zum Zitat Taylor, M. (1968). Graph-theoretic approaches to the theory of social choice. Public Choice, 4, 35–47. CrossRef Taylor, M. (1968). Graph-theoretic approaches to the theory of social choice. Public Choice, 4, 35–47. CrossRef
Zurück zum Zitat Winkler, P. (1982). Average height in a partially ordered set. Discrete Mathematics, 39, 337–341. CrossRef Winkler, P. (1982). Average height in a partially ordered set. Discrete Mathematics, 39, 337–341. CrossRef
Metadaten
Titel
Elections with partially ordered preferences
verfasst von
Michael Ackerman
Sul-Young Choi
Peter Coughlin
Eric Gottlieb
Japheth Wood
Publikationsdatum
01.10.2013
Verlag
Springer US
Erschienen in
Public Choice / Ausgabe 1-2/2013
Print ISSN: 0048-5829
Elektronische ISSN: 1573-7101
DOI
https://doi.org/10.1007/s11127-012-9930-3

Weitere Artikel der Ausgabe 1-2/2013

Public Choice 1-2/2013 Zur Ausgabe

Premium Partner