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 ce...
Saved in:
Main Authors: | CHANG, Pao-Li, CHUA, Vincent, MACHOVER, Moshe |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2004
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/soe_research/827 https://ink.library.smu.edu.sg/context/soe_research/article/1826/viewcontent/ccm.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
L S Penrose's Limit Theorem: Tests by simulation
by: Chang, Pao Li, et al.
Published: (2006) -
The central limit theorem for weighted minimal spanning trees on random points
by: Kesten, H., et al.
Published: (2014) -
Central limit theorems of sums of powers of function of independent random variables
by: Kittipong Laipaporn, 1976
Published: (2007) -
Limit theorems for Markov random walks
by: Tang, L.C.
Published: (2014) -
Limit theorems for Markov random walks
by: Tang, L.C.
Published: (2014)