Solving the generalized apportionment problem through the optimization of discrepancy functions
One of the ways to solve the classical apportionment problem (which has been studied chiefly in relation to the apportionment of seats in a chamber of representatives) is the optimization of a discrepancy function; although this approach seems very natural, it has been hardly used. In this paper, we...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2001 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/6081 |
| Acceso en línea: | https://hdl.handle.net/2117/6081 |
| Access Level: | acceso abierto |
| Palabra clave: | Combinatorial optimization Combinatorial analysis Apportionment problem Análisis combinatorio Anàlisi combinatori Optimització combinatòria Àrees temàtiques de la UPC::Economia i organització d'empreses::Direcció d'operacions |
| Sumario: | One of the ways to solve the classical apportionment problem (which has been studied chiefly in relation to the apportionment of seats in a chamber of representatives) is the optimization of a discrepancy function; although this approach seems very natural, it has been hardly used. In this paper, we propose a more general formalization of the problem and an optimization procedure for a broad class of discrepancy functions, study the properties of the procedure and present some examples in which it is applied. |
|---|