Skip to main content
Log in

How to choose a compatible committee?

  • Published:
Public Choice Aims and scope Submit manuscript

Abstract

Electing a committee of size k from m candidates (\(k < m\)) is an interesting problem under multi-winner voting situations. In this paper, we propose a new committee selection rule based on cooperative game theoretic tools, where voters can approve both individuals and groups of candidates simultaneously. This flexibility of approving groups of candidates allows the voters to assess the candidates’ compatibility to work in a group. In many situations, the k-elected candidates have no particular status as a group and voters in such multi-winner elections are presumably concerned about the personal qualities of the candidates. However, many committees function in unison and therefore, their productivity also depends on the compatibility of the members to accomplish a task together. We assume that the voters have prior beliefs about this compatibility. The profile of summed approval votes constitutes the characteristic function of a cooperative game. The Shapley value of this game is calculated to measure the candidates’ expected marginal contributions in accomplishing the group task as perceived by the voters. The top k-ranked candidates prescribed by the Shapley value are selected to form the desired committee. The Shapley value as a committee selection rule is characterized by a set of intuitive axioms. We explore several properties of the committee selection rule.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Notes

  1. For instance, this can be seen in the selection process of national soccer teams. If players are individually rated, the strikers tend to receive the highest ratings. Consequently, if the team is formed solely based on these individual ratings, it would primarily consist of strikers. This means that crucial positions such as the goalkeeper or the defenders may not be represented at all or have players with lower ratings. However, this approach is not ideal for creating a well-balanced soccer team.

References

  • Aragones, E., Gilboa, I., & Weiss, A. (2011). Making statements and approval voting. Theory and Decision, 71(4), 461–472.

    Article  Google Scholar 

  • Aziz, H., Brill, M., Conitzer, E., Elkind, E., Freeman, R., & Walsh, T. (2016). Justified representation in approval-based committee voting. Social Choice and Welfare, 48, 461–485.

    Article  Google Scholar 

  • Barbera, S., & Coelho, D. (2008). How to choose a non-controversial list of \(k\) names. Social Choice and Welfare, 31, 79–96.

    Article  Google Scholar 

  • Bernardi, G., Lucchetti, R., & Moretti, S. (2019). Ranking objects from a preference relation over their subsets. Social Choice and Welfare, 52, 589–606.

    Article  Google Scholar 

  • Brams, S. J., & Fishburn, P. C. (1978). Approval Voting. The American Political Science Review, 72(3), 831–847.

    Article  Google Scholar 

  • Brams, S. J., & Herschbach, D. R. (2001). The science of elections. Science, 292(5521), 1449.

    Article  Google Scholar 

  • Casajus, A. (2014). The Shapley value without efficiency and additivity. Mathematical Social Sciences, 68, 1–4.

    Article  Google Scholar 

  • Darmann, A. (2013). How hard is it to tell which is a Condorcet committee? Mathematical Social Sciences, 66(3), 282–292.

    Article  Google Scholar 

  • Dutta, R., Roy, S., & Borkotokey, S. (2023). The Generalized Shapley Value of Cooperative Games as a Social Preference Function. Group Decision and Negotiation, 32(2), 277–300.

    Google Scholar 

  • Dehez, P., & Ginsburgh, V. (2020). Approval voting and Shapley ranking. Public Choice, 184, 415–428.

    Article  Google Scholar 

  • Diss, M., & Doghmi, A. (2016). Multi-winner scoring election methods: Condorcet consistency and paradoxes. Public Choice, 169, 97–116.

    Article  Google Scholar 

  • Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the web. In Proceedings of the\(10^{th}\)International World Wide Web Conference (pp. 613-622)

  • Einy, E., & Haimanko, O. (2011). Characterization of the Shapley-Shubik power index without the efficiency axiom. Games and Economic Behavior, 73, 615–621.

    Article  Google Scholar 

  • Elkind, E., Faliszewski, P., Skowron, P., & Slinko, A. (2017). Properties of multi-winner voting rules. Social Choice and Welfare, 48(3), 599–632.

    Article  Google Scholar 

  • Faliszewski, P., Skowron, P., Slinko, A., & Talmon, N. (2018). Multi-winner analogues of the plurality rule: Axiomatic and algorithmic perspectives. Social Choice and Welfare, 51(3), 513–550.

    Article  Google Scholar 

  • Goel, A., Krishnaswamy, A. K., Sakshuwong, S., & Aitamurto, T. (2015). Knapsack voting. Collective Intelligence, 1.

  • Ianovski, E. (2022). Electing a committee with dominance constraints. Annals of Operation Research, 318, 985–1000.

    Article  Google Scholar 

  • Kamwa, E., & Merlin, V. (2015). Scoring rules over subsets of alternatives: Consistency and paradoxes. Journal of Mathematical Economics, 61, 130–138.

    Article  Google Scholar 

  • Kilgour, D. M., Brams, S. J., & Sanver, M. R. (2006). How to elect a representative committee using approval balloting. In B. Simeone & F. Pukelsheim (Eds.), Mathematics and democracy (pp. 83–95). Berlin: Springer.

    Chapter  Google Scholar 

  • Kilgour, D. M. (2010). Approval balloting for multi-winner elections. In J. F. Laslier & M. R. Sanver (Eds.), Handbook on approval voting (pp. 105–124). Berlin: Springer.

    Chapter  Google Scholar 

  • Kilgour, D. M., & Marshall, E. (2012). Approval balloting for fixed-size committees. In D. S. Felsenthal & M. Machover (Eds.), Electoral systems: Paradoxes, assumptions, and procedures (pp. 305–326). Berlin: Springer.

    Chapter  Google Scholar 

  • Kondratev, A., & Mazalov, V. (2017). A Ranking Procedure with the Shapley Value. In Nguyen, N., Tojo, S., Nguyen, L., & Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2017.

  • Lackner, M., & Skowron, P. (2021). Consistent approval-based multi-winner rules. Journal of Economic Theory, 192, 105–173.

    Article  Google Scholar 

  • Lackner, M., & Skowron, P. (2022). Multi-Winner Voting with Approval Preferences. Springer Briefs in Intelligent Systems Artificial Intelligence, Multiagent Systems, and Cognitive Robotics. Springer Cham.

  • Lu, T., & Boutilier, C. (2011). Budgeted social choice: from consensus to personalized decision making. In Proceedings of the\(22^{nd}\)International Joint Conference on Artificial Intelligence (pp. 280–286)

  • Lucchetti, R., Moretti, S., & Patrone, F. (2015). Ranking sets of interacting objects via semi-values. TOP, 23, 567–590.

    Article  Google Scholar 

  • Moretti, S. (2015). An axiomatic approach to social ranking under coalitional power relations. Homo Oeconomicus, 32(2), 183–208.

    Google Scholar 

  • Ratliff, T. C. (2003). Some startling inconsistencies when electing committees. Social Choice and Welfare, 21(3), 433–454.

    Article  Google Scholar 

  • Ratliff, T. C. (2006). Selecting Committees. Public Choice, 126, 343–355.

    Article  Google Scholar 

  • Ratliff, T. C., & Saari, D. G. (2014). Complexities of electing diverse committees. Social Choice and Welfare, 43, 55–71.

    Article  Google Scholar 

  • Shapley, L. S. (1953). A value for \(n\) - person games. In H. Kuhn & A. W. Tucker (Eds.), Contribution to the theory of games II (pp. 307–317). Princeton: Princeton University Press.

    Google Scholar 

  • Shmoys, D., Tardos, E., & Aardal, K. (1997). Approximation algorithms for facility location problems. In Proceedings of the 29th symposium on Theory of Computing (STOC -1997), (pp. 265–274)

  • Skowron, P., Faliszewski, P., & Lang, J. (2016). Finding a collection set of items: From proportional multi representation to group recommendation. Artificial Intelligence, 241, 191–216.

    Article  Google Scholar 

  • Uckelmen, J. (2010). Alice and Bob will fight: The problem of electing a committee in the presence of candidate interdependence. ECAI \(2010-19\)th European Conference on Artificial Intelligence, Lisbon, Portugal, August \(16-20\), \(2010\), Proceedings.

  • Weber, R. J. (1995). Approval Voting. Journal of Economic Perspectives, 9(1), 39–49.

    Article  Google Scholar 

Download references

Acknowledgements

We wish to thank the Editor, the Associate Editors, and two anonymous referees for their valuable insights and constructive suggestions. We also acknowledge Déarbhla Neill and Heather Dickey for their assistance in proofreading this paper. The third author acknowledges DST PURSE with grant no. SR/PURSE/2022/143.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Surajit Borkotokey.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dutta, R., Kumar, R. & Borkotokey, S. How to choose a compatible committee?. Public Choice (2024). https://doi.org/10.1007/s11127-024-01163-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11127-024-01163-3

Keywords

Navigation