Skip to main content
Top

25-02-2024

Volumetric Aggregation Methods for Scoring Rules with Unknown Weights

Author: Paolo Viappiani

Published in: Group Decision and Negotiation

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Scoring rules are a popular method for aggregating rankings; they are frequently used in many settings, including social choice, information retrieval and sports. Scoring rules are parametrized by a vector of weights (the scoring vectors), one for each position, and declare as winner the candidate that maximizes the score obtained when summing up the weights corresponding to the position of each voter. It is well known that properly setting the weights is a crucial task, as different candidates can win with different scoring vectors. In this paper, we provide several methods to identify the winner considering all possible weights. We first propose VolumetricTop, a rule that ranks alternatives based on the hyper-polytope representing the set of weights that give the alternative the highest score, and provide a detailed analysis of the rule from the point-of-view of social choice theory. In order to overcome some of its limitations, we then propose two other methods: Volumetric-runoff, a rule that iteratively eliminates the alternative associated with the smallest region until a winner is found, and Volumetric-tournament, where alternatives are matched in pairwise comparisons; we provide several insights about these rules. Finally we provide some test cases of rank aggregation using the proposed methods.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

Appendix
Available only for authorised users
Footnotes
1
There is some redundancy in the constraints: it is enough to assume convexity and \(w_{m-1}\ge 0\) to ensure that the sequence is not increasing.
 
3
See also Viappiani (2020) for analysis of this dataset with respect to possible winners and with minimax-regret.
 
Literature
go back to reference Andersen P, Petersen C (1993) A procedure for ranking efficient units in data envelopment analysis. Manag Sci 39(10):1261–1264CrossRef Andersen P, Petersen C (1993) A procedure for ranking efficient units in data envelopment analysis. Manag Sci 39(10):1261–1264CrossRef
go back to reference Arrow KJ (1950) A difficulty in the concept of social welfare. J Polit Econ 58(4):328–346CrossRef Arrow KJ (1950) A difficulty in the concept of social welfare. J Polit Econ 58(4):328–346CrossRef
go back to reference Baldwin (1926) The technique of the nanson preferential majority system of election. Proc R Soc Vic 39:42–52 Baldwin (1926) The technique of the nanson preferential majority system of election. Proc R Soc Vic 39:42–52
go back to reference Baumeister D, Roos M, Rothe J, Schend L, Xia L (2012) The possible winner problem with uncertain weights. In: ECAI 2012—20th European conference on artificial intelligence, Montpellier, France, August 27–31 , 2012, pp 133–138 Baumeister D, Roos M, Rothe J, Schend L, Xia L (2012) The possible winner problem with uncertain weights. In: ECAI 2012—20th European conference on artificial intelligence, Montpellier, France, August 27–31 , 2012, pp 133–138
go back to reference Bossert W, Suzumura K (2020) Positionalist voting rules: a general definition and axiomatic characterizations. Soc Choice Welf 55(1):85–116MathSciNetCrossRef Bossert W, Suzumura K (2020) Positionalist voting rules: a general definition and axiomatic characterizations. Soc Choice Welf 55(1):85–116MathSciNetCrossRef
go back to reference Cook WD, Kress M (1990) A data envelopment model for aggregating preference rankings. Manag Sci 36(11):1302–1310CrossRef Cook WD, Kress M (1990) A data envelopment model for aggregating preference rankings. Manag Sci 36(11):1302–1310CrossRef
go back to reference de Borda J-C (1781) Mémoire sur les élections au scrutin. Histoire de l’Académie Royale des Sciences de Borda J-C (1781) Mémoire sur les élections au scrutin. Histoire de l’Académie Royale des Sciences
go back to reference Dery LN, Kalech M, Rokach L, Shapira B (2016) Reducing preference elicitation in group decision making. Expert Syst Appl 61:246–261CrossRef Dery LN, Kalech M, Rokach L, Shapira B (2016) Reducing preference elicitation in group decision making. Expert Syst Appl 61:246–261CrossRef
go back to reference Fishburn P, Gehrlein W (1976) Borda’s rule, positional voting, and Condorcet’s simple majority principle. Public Choice 28:79–88CrossRef Fishburn P, Gehrlein W (1976) Borda’s rule, positional voting, and Condorcet’s simple majority principle. Public Choice 28:79–88CrossRef
go back to reference Foroughi AA, Tamiz M (2005) An effective total ranking model for a ranked voting system. Omega 33(6):491–496CrossRef Foroughi AA, Tamiz M (2005) An effective total ranking model for a ranked voting system. Omega 33(6):491–496CrossRef
go back to reference García-Lapresta JL, Martínez-Panero M (2017) Positional voting rules generated by aggregation functions and the role of duplication. Int J Intell Syst 32(9):926–946CrossRef García-Lapresta JL, Martínez-Panero M (2017) Positional voting rules generated by aggregation functions and the role of duplication. Int J Intell Syst 32(9):926–946CrossRef
go back to reference Goldsmith J, Lang J, Mattei N, Perny P (2014) Voting with rank dependent scoring rules. In: Proceedings of the twenty-eighth AAAI conference on artificial intelligence, July 27 –31, 2014, Québec City, QC, Canada, pp 698–704 Goldsmith J, Lang J, Mattei N, Perny P (2014) Voting with rank dependent scoring rules. In: Proceedings of the twenty-eighth AAAI conference on artificial intelligence, July 27 –31, 2014, Québec City, QC, Canada, pp 698–704
go back to reference Green RH, Doyle JR, Cook WD (1996) Preference voting and project ranking using DEA and cross-evaluation. Eur J Oper Res 90(3):461–472CrossRef Green RH, Doyle JR, Cook WD (1996) Preference voting and project ranking using DEA and cross-evaluation. Eur J Oper Res 90(3):461–472CrossRef
go back to reference Haghtalab N, Noothigattu R, Procaccia AD (2018) Weighted voting via no-regret learning. In: Proceedings of the thirty-second AAAI conference on artificial intelligence (AAAI-18), New Orleans, Louisiana, USA, February 2–7, 2018, pp 1055–1062 Haghtalab N, Noothigattu R, Procaccia AD (2018) Weighted voting via no-regret learning. In: Proceedings of the thirty-second AAAI conference on artificial intelligence (AAAI-18), New Orleans, Louisiana, USA, February 2–7, 2018, pp 1055–1062
go back to reference Hashimoto A (1997) A ranked voting system using a DEA/AR exclusion model: a note. Eur J Oper Res 97(3):600–604CrossRef Hashimoto A (1997) A ranked voting system using a DEA/AR exclusion model: a note. Eur J Oper Res 97(3):600–604CrossRef
go back to reference Hazen GB (1986) Partial information, dominance, and potential optimality in multiattribute utility theory. Oper Res 34(2):296–310MathSciNetCrossRef Hazen GB (1986) Partial information, dominance, and potential optimality in multiattribute utility theory. Oper Res 34(2):296–310MathSciNetCrossRef
go back to reference Khodabakhshi M, Aryavash K (2015) Aggregating preference rankings using an optimistic–pessimistic approach. Comput Ind Eng 85:13–16CrossRef Khodabakhshi M, Aryavash K (2015) Aggregating preference rankings using an optimistic–pessimistic approach. Comput Ind Eng 85:13–16CrossRef
go back to reference Lang J (2020) Collective decision making under incomplete knowledge: possible and necessary solutions. In: Bessiere C (ed) Proceedings of the twenty-ninth international joint conference on artificial intelligence (IJCAI 2020), pp 4885–4891. ijcai.org Lang J (2020) Collective decision making under incomplete knowledge: possible and necessary solutions. In: Bessiere C (ed) Proceedings of the twenty-ninth international joint conference on artificial intelligence (IJCAI 2020), pp 4885–4891. ijcai.org
go back to reference Llamazares B (2016) Ranking candidates through convex sequences of variable weights. Group Decis Negot 25:567–584CrossRef Llamazares B (2016) Ranking candidates through convex sequences of variable weights. Group Decis Negot 25:567–584CrossRef
go back to reference Llamazares B (2017) Aggregating preference rankings using an optimistic-pessimistic approach: closed-form expressions. Comput Ind Eng 110:109–113CrossRef Llamazares B (2017) Aggregating preference rankings using an optimistic-pessimistic approach: closed-form expressions. Comput Ind Eng 110:109–113CrossRef
go back to reference Llamazares B (2019) Using interval weights in MADM problems. Comput Ind Eng 136:345–354CrossRef Llamazares B (2019) Using interval weights in MADM problems. Comput Ind Eng 136:345–354CrossRef
go back to reference Llamazares B, Peña T (2009) Preference aggregation and DEA: an analysis of the methods proposed to discriminate efficient candidates. Eur J Oper Res 197(2):714–721CrossRef Llamazares B, Peña T (2009) Preference aggregation and DEA: an analysis of the methods proposed to discriminate efficient candidates. Eur J Oper Res 197(2):714–721CrossRef
go back to reference Llamazares B, Peña T (2013) Aggregating preferences rankings with variable weights. Eur J Oper Res 230(2):348–355MathSciNetCrossRef Llamazares B, Peña T (2013) Aggregating preferences rankings with variable weights. Eur J Oper Res 230(2):348–355MathSciNetCrossRef
go back to reference Llamazares B, Peña T (2015a) Positional voting systems generated by cumulative standings functions. Group Decis Negot 24(5):777–801CrossRef Llamazares B, Peña T (2015a) Positional voting systems generated by cumulative standings functions. Group Decis Negot 24(5):777–801CrossRef
go back to reference Llamazares B, Peña T (2015b) Scoring rules and social choice properties: some characterizations. Theor Decis 78(3):429–450MathSciNetCrossRef Llamazares B, Peña T (2015b) Scoring rules and social choice properties: some characterizations. Theor Decis 78(3):429–450MathSciNetCrossRef
go back to reference Lu T, Boutilier C (2020) Preference elicitation and robust winner determination for single- and multi-winner social choice. Artif Intell 66:279MathSciNet Lu T, Boutilier C (2020) Preference elicitation and robust winner determination for single- and multi-winner social choice. Artif Intell 66:279MathSciNet
go back to reference Malakooti B (2000) Ranking and screening multiple criteria alternatives with partial information and use of ordinal and cardinal strength of preferences. Trans Syst Man Cyber Part A 30(3):355–368CrossRef Malakooti B (2000) Ranking and screening multiple criteria alternatives with partial information and use of ordinal and cardinal strength of preferences. Trans Syst Man Cyber Part A 30(3):355–368CrossRef
go back to reference Martins MA, Garcez TV (2021) A multidimensional and multi-period analysis of safety on roads. Accid Anal Prev 162:106401CrossRefPubMed Martins MA, Garcez TV (2021) A multidimensional and multi-period analysis of safety on roads. Accid Anal Prev 162:106401CrossRefPubMed
go back to reference Merlin V (2003) The axiomatic characterizations of majority voting and scoring rules. Mathématiques et sciences humaines. Math Soc Sci 163:66 Merlin V (2003) The axiomatic characterizations of majority voting and scoring rules. Mathématiques et sciences humaines. Math Soc Sci 163:66
go back to reference Napolitano B, Cailloux O, Viappiani P (2021) Simultaneous elicitation of scoring rule and agent preferences for robust winner determination. In: Fotakis D, Insua DR (eds) Algorithmic decision theory—7th international conference, ADT 2021, Toulouse, France, November 3–5, 2021, Proceedings, volume 13023 of lecture notes in computer science. Springer, Berlin, pp 51–67 Napolitano B, Cailloux O, Viappiani P (2021) Simultaneous elicitation of scoring rule and agent preferences for robust winner determination. In: Fotakis D, Insua DR (eds) Algorithmic decision theory—7th international conference, ADT 2021, Toulouse, France, November 3–5, 2021, Proceedings, volume 13023 of lecture notes in computer science. Springer, Berlin, pp 51–67
go back to reference Narodytska N, Walsh T, Xia L (2012) Combining voting rules together. In: De Raedt L, Bessiere C, Dubois D, Doherty P, Frasconi P, Heintz F, Lucas PJF (eds) ECAI 2012—20th European conference on artificial intelligence. Including prestigious applications of artificial intelligence (PAIS-2012) system demonstrations track, Montpellier, France, August 27–31 , 2012, volume 242 of frontiers in artificial intelligence and applications. IOS Press, pp 612–617 Narodytska N, Walsh T, Xia L (2012) Combining voting rules together. In: De Raedt L, Bessiere C, Dubois D, Doherty P, Frasconi P, Heintz F, Lucas PJF (eds) ECAI 2012—20th European conference on artificial intelligence. Including prestigious applications of artificial intelligence (PAIS-2012) system demonstrations track, Montpellier, France, August 27–31 , 2012, volume 242 of frontiers in artificial intelligence and applications. IOS Press, pp 612–617
go back to reference Nurmi H (2010) Voting systems for social choice. In: Marc Kilgour D, Eden C (eds) Handbook of group decision and negotiation, volume 4 of advances in group decision and negotiation. Springer, Berlin, pp 167–182CrossRef Nurmi H (2010) Voting systems for social choice. In: Marc Kilgour D, Eden C (eds) Handbook of group decision and negotiation, volume 4 of advances in group decision and negotiation. Springer, Berlin, pp 167–182CrossRef
go back to reference Obata T, Ishii H (2003) A method for discriminating efficient candidates with ranked voting data. Eur J Oper Res 151(1):233–237MathSciNetCrossRef Obata T, Ishii H (2003) A method for discriminating efficient candidates with ranked voting data. Eur J Oper Res 151(1):233–237MathSciNetCrossRef
go back to reference Pearman AD (1993) Establishing dominance in multiattribute decision making using an ordered metric method. J Oper Res Soc 44(5):461–469CrossRef Pearman AD (1993) Establishing dominance in multiattribute decision making using an ordered metric method. J Oper Res Soc 44(5):461–469CrossRef
go back to reference Peterson M (2017) An introduction to decision theory, 2nd edn. Cambridge introductions to philosophy. Cambridge University Press, CambridgeCrossRef Peterson M (2017) An introduction to decision theory, 2nd edn. Cambridge introductions to philosophy. Cambridge University Press, CambridgeCrossRef
go back to reference Procaccia AD, Zohar A, Peleg Y, Rosenschein JS (2009) The learnability of voting rules. Artif Intell 173(12–13):1133–1149MathSciNetCrossRef Procaccia AD, Zohar A, Peleg Y, Rosenschein JS (2009) The learnability of voting rules. Artif Intell 173(12–13):1133–1149MathSciNetCrossRef
go back to reference Stein WE, Mizzi PJ, Pfaffenberger RC (1994) A stochastic dominance analysis of ranked voting systems with scoring. Eur J Oper Res 74(1):78–85CrossRef Stein WE, Mizzi PJ, Pfaffenberger RC (1994) A stochastic dominance analysis of ranked voting systems with scoring. Eur J Oper Res 74(1):78–85CrossRef
go back to reference Viappiani P (2020) Robust winner determination in positional scoring rules with uncertain weights. Theor Decis 88(3):323–367MathSciNetCrossRef Viappiani P (2020) Robust winner determination in positional scoring rules with uncertain weights. Theor Decis 88(3):323–367MathSciNetCrossRef
go back to reference Xia L, Conitzer V (2011) Determining possible and necessary winners given partial orders. J Artif Intell Res 41:25–67CrossRef Xia L, Conitzer V (2011) Determining possible and necessary winners given partial orders. J Artif Intell Res 41:25–67CrossRef
go back to reference Zhao Z, Li H, Wang J, Kephart JO, Mattei N, Su H, Xia L (2018) A cost-effective framework for preference elicitation and aggregation. In: Globerson A, Silva R (eds) Proceedings of the thirty-fourth conference on uncertainty in artificial intelligence, UAI 2018, Monterey, CA, USA, August 6–10, 2018. AUAI Press, pp 446–456 Zhao Z, Li H, Wang J, Kephart JO, Mattei N, Su H, Xia L (2018) A cost-effective framework for preference elicitation and aggregation. In: Globerson A, Silva R (eds) Proceedings of the thirty-fourth conference on uncertainty in artificial intelligence, UAI 2018, Monterey, CA, USA, August 6–10, 2018. AUAI Press, pp 446–456
go back to reference Zheng G, Wang Y, Li C, Wang X (2020) Real-time quantification of human physiological state in high temperature environments based on variable weight theory. J Therm Biol 89:102531CrossRefPubMed Zheng G, Wang Y, Li C, Wang X (2020) Real-time quantification of human physiological state in high temperature environments based on variable weight theory. J Therm Biol 89:102531CrossRefPubMed
go back to reference Zwicker WS (2016) Introduction to the theory of voting. In: Handbook of computational social choice. Cambridge University Press, Cambridge, pp 23–56 Zwicker WS (2016) Introduction to the theory of voting. In: Handbook of computational social choice. Cambridge University Press, Cambridge, pp 23–56
Metadata
Title
Volumetric Aggregation Methods for Scoring Rules with Unknown Weights
Author
Paolo Viappiani
Publication date
25-02-2024
Publisher
Springer Netherlands
Published in
Group Decision and Negotiation
Print ISSN: 0926-2644
Electronic ISSN: 1572-9907
DOI
https://doi.org/10.1007/s10726-023-09872-8