L S Penrose's limit theorem: Tests by simulation
LS Penrose’s limit theorem (PLT) – which is implicit in Penrose [5, p. 72] and for which he gave no rigorous proof – says that, in simple weighted voting games, if the number of voters increases indefinitely while existing voters retain their weights and the relative quota is pegged, then – under certain conditions – the ratio between the voting powers of any two voters converges to the ratio between their weights. Lindner and Machover  prove some special cases of PLT; and conjecture that the theorem holds, under rather general conditions, for large classes of weighted voting games, various values of the quota, and with respect to several measures of voting power. We use simulation to test this conjecture. It is corroborated w.r.t. the Penrose–Banzhaf index for a quota of 50% but not for other values; w.r.t. the Shapley–Shubik index the conjecture is corroborated for all values of the quota (short of 100%).
(This abstract was borrowed from another version of this item.)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Lindner, Ines & Machover, Moshe, 2004. "L.S. Penrose's limit theorem: proof of some special cases," Mathematical Social Sciences, Elsevier, vol. 47(1), pages 37-49, January.
When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:51:y:2006:i:1:p:90-106. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If references are entirely missing, you can add them using this form.