Skip to main content
Log in

Computer-assisted constrained approval voting

  • Published:
Group Decision and Negotiation Aims and scope Submit manuscript

Abstract

Approval voting, proposed independently by several analysts in the 1970s, is a voting system in which voters can vote for as many candidates as they like in multicandidate elections. Recently, S.J. Brams modified this system, introducing so-called constrained approval voting. It is designed for a professional association to ensure equitable representation of different interests. In his new system approval voting is combined with the constraints on the number of persons that can be elected from different categories of members. In the present paper the problem of constrained approval voting is formulated (following the work of R.F. Potthoff) as an integer programming problem. Some computational aspects of this problem are discussed. The paper presents a numerical example illustrating a possibility to apply the discussed voting procedure in the election of members of the Committee for Organization and Management Sciences of the Polish Academy of Sciences.

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

References

  • Brams, S.J. (1990). “Constrained Approval Voting: A Voting System to Elect a Governing Board.”Interfaces 20 (September–October).

  • Brams, S.J., and P.C. Fishburn. (1983).Approval Voting. Boston: Birkhauser.

    Google Scholar 

  • Brams, S.J., and P.C. Fishburn. (1990). “Approval Voting in Scientific and Engineering Societies.” Report of Department of Politics, New York University.

  • Potthoff, R.F. (1990). “Use of Linear Programming for Constrained Approval Voting.” Report of Department of Economics, North Carolina Agricultural and Technical State University, Greensboro.

  • Sikorski, J. (1986). “Quasi-subgradient Algorithms for Calculating Surrogate Constraints.” In K. Malanowski and K. Mizukami (eds.),Lecture Notes in Control and Information Sciences, Vol. 82. Berlin: Springer Verlag.

    Google Scholar 

  • Sikorski, J. (1990). “On Calculation of Surrogate Constraints in Branch and Bound Methods” (in Polish). Report of the Systems Research Institute of Polish Academy of Sciences, ZPM-1/I/573/90, Warszawa.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Straszak, A., Libura, M., Sikorski, J. et al. Computer-assisted constrained approval voting. Group Decis Negot 2, 375–385 (1993). https://doi.org/10.1007/BF01384490

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01384490

Keywords

Navigation