References

[1] Alnur Ali and Marina Meilă. 2012. Experiments with Kemeny ranking: What works when? Mathematical Social Sciences 64, 1 (2012), 28–40.

[2] Sihem Amer-Yahia, Shady Elbassuoni, Behrooz Omidvar-Tehrani, Ria Mae Borromeo, and Mehrdad Farokhnejad. 2019. Grouptravel: Customizing travel packages for groups. In 22nd International Conference on Extending Database Technology (EDBT).

[3] Sihem Amer-Yahia, Senjuti Basu Roy, Ashish Chawlat, Gautam Das, and Cong Yu. 2009. Group recommendation: Semantics and efciency. Proceedings of the VLDB Endowment 2, 1 (2009), 754–765.

[4] Kenneth J Arrow. 1950. A difculty in the concept of social welfare. Journal of political economy 58, 4 (1950), 328–346.

[5] Kenneth J Arrow, Amartya Sen, and Kotaro Suzumura. 2010. Handbook of social choice and welfare. Elsevier.

[6] Anastasios Arvanitis and Georgia Koutrika. 2012. Towards preference-aware relational databases. In 2012 IEEE 28th International Conference on Data Engineering. IEEE, 426–437.

[7] Haris Aziz and Nisarg Shah. 2021. Participatory budgeting: Models and approaches. In Pathways Between Social Science and Computational Social Science.Springer, 215–236.

[8] John Bartholdi and James Orlin. 1991. Single transferable vote resists strategic voting. Social Choice and Welfare 8 (01 1991), 341–354. https://doi.org/10.1007/BF00183045

[9] Sanjoy K Baruah, Neil K Cohen, C Greg Plaxton, and Donald A Varvel. 1996. Proportionate progress: A notion of fairness in resource allocation. Algorithmica 15, 6 (1996), 600–625.

[10] Sanjoy K Baruah, Johannes E Gehrk, C Greg Plaxton, Ion Stoica, Hussein AbdelWahab, and Kevin Jefay. 1997. Fair on-line scheduling of a dynamic set of tasks on a single resource. Inform. Process. Lett. 64, 1 (1997), 43–51.

[11] Senjuti Basu Roy, Laks VS Lakshmanan, and Rui Liu. 2015. From group recommendations to group formation. In Proceedings of the 2015 ACM SIGMOD international conference on management of data. 1603–1616.

[12] Alex Beutel, Jilin Chen, Tulsee Doshi, Hai Qian, Li Wei, Yi Wu, Lukasz Heldt, Zhe Zhao, Lichan Hong, Ed H Chi, et al. 2019. Fairness in recommendation ranking through pairwise comparisons. In Proceedings of the 25th ACM SIGKDD international conference on knowledge discovery & data mining. 2212–2220.

[13] Ronen Brafman and Carmel Domshlak. 2004. Database preference queries revisited. Technical Report. Cornell University.

[14] Steven Brams and Peter C. Fishburn. 2007. Approval voting.

[15] Felix Brandt, Vincent Conitzer, Ulle Endriss, Jérôme Lang, and Ariel D. Procaccia. 2016. Handbook of computational social choice. Cambridge University Press.

[16] Ioannis Caragiannis, Jason A Covey, Michal Feldman, Christopher M Homan, Christos Kaklamanis, Nikos Karanikolas, Ariel D Procaccia, and Jefrey S Rosenschein. 2012. On the approximability of Dodgson and Young elections. Artifcial Intelligence 187 (2012), 31–51.

[17] L Elisa Celis, Damian Straszak, and Nisheeth K Vishnoi. 2017. Ranking with fairness constraints. arXiv preprint arXiv:1704.06840 (2017).

[18] Jan Chomicki. 2003. Preference formulas in relational queries. ACM Transactions on Database Systems (TODS) 28, 4 (2003), 427–466.

[19] Edith Elkind et al. 2017. What do multiwinner voting rules do? An experiment over the two-dimensional Euclidean domain. In AAAI ’17. 494–501.

[20] Ulle Endriss. 2017. Trends in computational social choice. AI Access.

[21] Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, and Nimrod Talmon. 2017. Multiwinner voting: A new challenge for social choice theory. In Trends in computational social choice, Ulle Endriss (Ed.). AI Access, 27–47.

[22] Allan Gibbard. 1973. Manipulation of voting schemes: a general result. Econometrica: journal of the Econometric Society (1973), 587–601.

[23] Lei Guo, Hongzhi Yin, Qinyong Wang, Bin Cui, Zi Huang, and Lizhen Cui. 2020. Group recommendation with latent voting mechanism. In 2020 IEEE 36th International Conference on Data Engineering (ICDE). IEEE, 121–132.

[24] Edith Hemaspaandra, Holger Spakowski, and Jörg Vogel. 2005. The complexity of Kemeny elections. Theoretical Computer Science 349, 3 (2005), 382–391.

[25] Zhenhua Huang et al. 2020. Social group recommendation with TrAdaBoost. TCSS (2020).

[26] Md Mouinul Islam, Mahsa Asadi, and Senjuti Basu Roy. 2023. Equitable Top-k Results for Long Tail Data. Proceedings of the ACM on Management of Data 1, 4 (2023), 1–24.

[27] Md Mouinul Islam, Soroush Vahidi, Baruch Schieber, and Senjuti Basuroy. 2024. Promoting Fairness and Priority in �-Winners Selection Using IRV. In KDD. ACM. https://doi.org/10.1145/3637528.3671735

[28] Md. Mouinul Islam, Dong Wei, Baruch Schieber, and Senjuti Basu Roy. 2022. Satisfying complex top-k fairness constraints by preference substitutions. Proc. VLDB Endow. 16, 2 (oct 2022), 317—-329.

[29] Georgia Koutrika and Yannis Ioannidis. 2005. Personalized queries under a generalized preference model. In 21st International Conference on Data Engineering (ICDE’05). IEEE, 841–852.

[30] Caitlin Kuhlman and Elke Rundensteiner. 2020. Rank aggregation algorithms for fair consensus. Proceedings of the VLDB Endowment 13, 12 (2020).

[31] Thomas R. Magrino, Ronald L. Rivest, Emily Shen, and David Wagner. 2011. Computing the margin of victory in IRV elections. In Proceedings of the 2011 Conference on Electronic Voting Technology/Workshop on Trustworthy Elections (San Francisco, CA) (EVT/WOTE’11). USENIX Association, USA, 4.

[32] Kenneth O May. 1952. A set of independent necessary and sufcient conditions for simple majority decision. Econometrica: Journal of the Econometric Society (1952), 680–684.

[33] Evaggelia Pitoura, Kostas Stefanidis, and Georgia Koutrika. 2022. Fairness in rankings and recommendations: an overview. The VLDB Journal (2022), 1–28.

[34] Senjuti Basu Roy. 2022. Returning top-k: Preference aggregation or sortition, or is there a better middle ground. SIGMOD Blog (2022).

[35] Senjuti Basu Roy. 2024. Fairness and Robustness in Answering Preference Queries. Data Engineering (2024), 36.

[36] Donald G. Saari. 2006. Which is better: the Condorcet or Borda winner? Social Choice and Welfare 26, 1 (2006), 107.

[37] Anand Sarwate, Stephen Checkoway, and Hovav Shacham. 2013. Risk-Limiting Audits and the Margin of Victory in Nonplurality Elections. Statistics, Politics, and Policy 4, 1 (Jan. 2013), 29–64.

[38] Mark Allen Satterthwaite. 1975. Strategy-proofness and Arrow’s conditions: Existence and correspondence theorems for voting procedures and social welfare functions. Journal of economic theory 10, 2 (1975), 187–217.

[39] Ashudeep Singh, David Kempe, and Thorsten Joachims. 2021. Fairness in ranking under uncertainty. Advances in Neural Information Processing Systems 34 (2021), 11896–11908.

[40] Piotr Skowron, Arkadii Slinko, Stanisław Szufa, and Nimrod Talmon. 2020. Participatory budgeting with cumulative votes. arXiv preprint arXiv:2009.02690 (2020).

[41] Julia Stoyanovich, Meike Zehlike, and Ke Yang. 2023. Fairness in Ranking: From Values to Technical Choices and Back. In Companion of the 2023 International Conference on Management of Data. 7–12.

[42] Nimrod Talmon and Piotr Faliszewski. 2019. A framework for approval-based budgeting methods. In AAAI ’17. 2181–2188.

[43] Nicolaus Tideman. 1995. The single transferable vote. Journal of Economic Perspectives 9, 1 (1995), 27–38.

[44] Robert Tijdeman. 1980. The chairman assignment problem. Discrete Mathematics 32, 3 (1980), 323–330.

[45] Dong Wei, Md Mouinul Islam, Baruch Schieber, and Senjuti Basu Roy. 2022. Rank Aggregation with Proportionate Fairness. In Proceedings of the 2022 International Conference on Management of Data (Philadelphia, PA, USA) (SIGMOD’22). Association for Computing Machinery, New York, NY, USA, 262––275.

[46] Peyton Young. 1995. Optimal voting rules. Journal of Economic Perspectives 9, 1 (1995), 51–64.

[47] Meike Zehlike, Francesco Bonchi, Carlos Castillo, Sara Hajian, Mohamed Megahed, and Ricardo Baeza-Yates. 2017. FA*IR: A fair top-k ranking algorithm. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. 1569–1578.

[48] Meike Zehlike, Ke Yang, and Julia Stoyanovich. 2021. Fairness in ranking: A survey. arXiv preprint arXiv:2103.14000 (2021).