Do you want BuboFlash to help you learning these things? Or do you want to add or correct something? Click here to log in or create user.

#computation #social-choice
Because the set of feasible subsets is generally exponentially large, finding the opti- mal subset is highly nontrivial. Brams and Potthoff (1998) were the first to discuss the computation of the Chamberlin-Courant and the Monroe voting schemes, showing that the optimal committee can be determined using integer programming. This provides a method that works in practice when the number of voters and items are small, but may not scale up well. They formulate an improved integer program for settings where the number of agents is large, but this modified integer program is still too large to be solved when the number of items is large
If you want to change selection, open document below and click on "Move attachment"


owner: rappatoni - (no access) - CompSocBook.pdf, p227


statusnot read reprioritisations
last reprioritisation on suggested re-reading day
started reading on finished reading on



Do you want to join discussion? Click here to log in or create user.