期刊
NETWORKS
卷 59, 期 1, 页码 73-88出版社
WILEY
DOI: 10.1002/net.20480
关键词
network flows; electoral systems; biproportional seat apportionment; matrix scaling; political districting; closed lists; give-up
Researchers in the area of electoral systems have recently turned their attention to network flow techniques with the aim to resolve certain practically relevant problems arising in this area. The aim of this paper is to review some of this work, showing the applicability of these techniques even to problems of a very different nature. Major emphasis will be placed on biproportional apportionment, a problem that frequently arises in proportional electoral systems, but which in some countries is still ill-solved, or not dealt with rigorously, notwithstanding the availability of several sound solution procedures and their concrete application in some real-life elections. Besides biproportional apportionment, we shall discuss applications of network flows to problems such as vote transitions and political districting. Finally, we address the so-called give-up problem, which arises in the current elections for the Italian Parliament. It is related to the possible assignment of seats to multiple winners of a given party. Based on the results and techniques presented in this article, it is fair to state that network flow models and algorithms are indeed very flexible and effective tools for the analysis and the design of contemporary electoral systems. (C) 2011 Wiley Periodicals, Inc. NETWORKS, Vol. 59(1), 73-88 2012
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据