Repositorio de producción científica de la Universidad de Sevilla

Mathematical programming formulations for the efficient solution of the k-sum approval voting problem


Advanced Search

Show simple item record

dc.creator Ponce López, Diego es
dc.creator Puerto Albandoz, Justo es
dc.creator Ricca, Federica es
dc.creator Scozzari, Andrea es 2018-09-21T06:38:10Z 2018-09-21T06:38:10Z 2018-10
dc.identifier.issn 0305-0548 es
dc.identifier.issn 1873-765X es
dc.description.abstract In this paper we address the problem of electing a committee among a set of m candidates and on the basis of the preferences of a set of n voters. We consider the approval voting method in which each voter can approve as many candidates as she/he likes by expressing a preference profile (boolean m-vector). In order to elect a committee, a voting rule must be established to ‘transform’ the n voters’ profiles into a winning committee. The problem is widely studied in voting theory; for a variety of voting rules the problem was shown to be computationally difficult and approximation algorithms and heuristic techniques were proposed in the literature. In this paper we follow an Ordered Weighted Averaging approach and study the k-sum approval voting (optimization) problem in the general case 1 ≤ k < n. For this problem we provide different mathematical programming formulations that allow us to solve it in an exact solution framework. We provide computational results showing that our approach is efficient for medium-size test problems (n up to 200, m up to 60) since in all tested cases it was able to find the exact optimal solution in very short computational times. es
dc.description.sponsorship Ministerio de Economía y Competitividad es
dc.description.sponsorship Fondo Europeo de Desarrollo Regional es
dc.format application/pdf es
dc.language.iso eng es
dc.publisher Elsevier es
dc.relation.ispartof Computers & Operations Research, 98, 127-136.
dc.rights Attribution-NonCommercial-NoDerivatives 4.0 Internacional *
dc.rights.uri *
dc.subject Approval voting es
dc.subject Ordered Weighted Averaging (OWA) es
dc.subject k-sum optimization problems es
dc.title Mathematical programming formulations for the efficient solution of the k-sum approval voting problem es
dc.type info:eu-repo/semantics/article es
dc.type.version info:eu-repo/semantics/submittedVersion es
dc.rights.accessrights info:eu-repo/semantics/openAccess es
dc.contributor.affiliation Universidad de Sevilla. Departamento de Estadística e Investigación Operativa es
dc.relation.projectID MTM2013-46962-C02-01 es
dc.relation.projectID MTM2016-74983-C02-01 es
dc.relation.publisherversion es
dc.identifier.doi 10.1016/j.cor.2018.05.014 es Universidad de Sevilla. FQM331: Métodos y Modelos de la Estadística y la Investigación Operativa es
idus.format.extent 20 p. es
dc.journaltitle Computers & Operations Research es
dc.publication.volumen 98 es
dc.publication.initialPage 127 es
dc.publication.endPage 136 es
dc.contributor.funder Ministerio de Economía y Competitividad (MINECO). España
dc.contributor.funder European Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER)
Size: 392.5Kb
Format: PDF

This item appears in the following Collection(s)

Show simple item record