2013
DOI: 10.1016/j.eswa.2013.03.035
|View full text |Cite
|
Sign up to set email alerts
|

A fast exact algorithm for the allocation of seats for the EU Parliament

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
20
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
4
3
3

Relationship

2
8

Authors

Journals

citations
Cited by 24 publications
(20 citation statements)
references
References 7 publications
0
20
0
Order By: Relevance
“…Recently, Łyko and Rudek (2013) have designed and implemented an algorithm that is able to find all feasible solutions. Nevertheless, all allocations of seats such that "nobody gain and nobody loses more than one" can be generated by an exhaustive search method.…”
Section: Methodsmentioning
confidence: 99%
“…Recently, Łyko and Rudek (2013) have designed and implemented an algorithm that is able to find all feasible solutions. Nevertheless, all allocations of seats such that "nobody gain and nobody loses more than one" can be generated by an exhaustive search method.…”
Section: Methodsmentioning
confidence: 99%
“…In this case, subject to boundary conditions for , , there still exist many sequences , which satisfy them, and a problem arises how to select a concrete allocation. In consequence, an area of both political as well as scientific discourse [3,4,5,6,7,8,9,10] is opened.…”
Section: Degressive Proportionality As a Rule Of Allocating Mandates mentioning
confidence: 99%
“…Generally, there are a great number of allocations that satisfy the DP conditions. Łyko & Rudek (2013) report there are around 29 million allocations of seats considering the current populations of the EU member states. A choice of a given allocation must be done in at least two stages.…”
Section: Alpha Proportionalitymentioning
confidence: 99%