Further Comments on Majority Rule Under Transitivity Constraints

Published Online:https://doi.org/10.1287/mnsc.20.11.1441

In their note [Blin, J. M., A. B. Whinston. 1974. A note on majority rule under transitivity constraints. Management Sci.20 (11) 1439–1440.], Blin and Whinston indicate that the linear integer programming formulation of the majority voting problem can also be formulated as a quadratic assignment problem. We wish to point out that both of these formulations are a result of the fact that majority decision functions can be linearized over the set of integer solutions to the linear program.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.