On Sep 5, 2008, at 2:26 , Raph Frank wrote:
On Thu, Sep 4, 2008 at 10:13 PM, Juho <[EMAIL PROTECTED]> wrote:
The simplest (not necessarily optimal) approach to implement multiple
dimensions is one where you simply elect representatives starting
from the
ones with strongest support (e.g. best candidate of the largest
party in the
largest district), skip candidates that can not be elected any
more (e.g.
district already full, party already full), and continue until all
seats
have been filled. At some point in the chain all "requirements" of
all
dimensions are met if they are strong enough (and if there are
suitable
candidates left).
I would probably elect the weakest of each party's strongest
candidates, e.g. find the strongest candidate from each party and then
assign a seat to that weakest of them.
Why weakest? What is the "weakest of each party's strongest candidates"?
Juho
Once a party gets its allocation of seats, it can't be assigned any
more.
This is to allow small parties fill in their seats before large
parties can lock them out.
----
Election-Methods mailing list - see http://electorama.com/em for
list info
___________________________________________________________
All new Yahoo! Mail "The new Interface is stunning in its simplicity and ease of use." - PC Magazine
http://uk.docs.yahoo.com/nowyoucan.html
----
Election-Methods mailing list - see http://electorama.com/em for list info
