|
Penrose Square Root Law
In the mathematical theory of games, the Penrose square root law, originally formulated by Lionel Penrose, concerns the distribution of the voting power in a voting body consisting of ''N'' members. It states that the ''a priori'' voting power of any voter, measured by the Penrose–Banzhaf index \psi scales like 1/\sqrt . This result was used to design the Penrose method for allocating the voting weights of representatives in a decision-making bodies proportional to the square root of the population represented. Short derivation To estimate the voting index of any player one needs to estimate the number of the possible winning coalitions in which his vote is decisive. Assume for simplicity that the number of voters is odd, ''N'' = 2''j'' + 1, and the body votes according to the standard majority rule. Following Penrose one concludes that a given voter will be able to effectively influence the outcome of the voting only if the votes split half and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Game Theory
Game theory is the study of mathematical models of strategic interactions among rational agents. Myerson, Roger B. (1991). ''Game Theory: Analysis of Conflict,'' Harvard University Press, p.&nbs1 Chapter-preview links, ppvii–xi It has applications in all fields of social science, as well as in logic, systems science and computer science. Originally, it addressed two-person zero-sum games, in which each participant's gains or losses are exactly balanced by those of other participants. In the 21st century, game theory applies to a wide range of behavioral relations; it is now an umbrella term for the science of logical decision making in humans, animals, as well as computers. Modern game theory began with the idea of mixed-strategy equilibria in two-person zero-sum game and its proof by John von Neumann. Von Neumann's original proof used the Brouwer fixed-point theorem on continuous mappings into compact convex sets, which became a standard method in game theory and mathema ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lionel Penrose
Lionel Sharples Penrose, FRS (11 June 1898 – 12 May 1972) was an English psychiatrist, medical geneticist, paediatrician, mathematician and chess theorist, who carried out pioneering work on the genetics of intellectual disability. Penrose was the Galton professor of eugenics (1945–1963), then professor of human genetics (1963–1965) at University College London, and later emeritus professor. Education Penrose was educated at the Downs School, Colwall and the Quaker Leighton Park School, Reading. On leaving school in 1916, he served, as a conscientious objector, with the Friends' Ambulance Unit/British Red Cross in France until the end of the First World War. He went on to study at St John's College, Cambridge, where he was a Cambridge Apostle. At Cambridge, he gained a first class degree in moral sciences before leaving for Vienna for a year, to study at the psychological department at the University of Vienna. In 1928, he qualified with the conjoint in 1928 at St Thomas' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Banzhaf Power Index
The Banzhaf power index, named after John F. Banzhaf III (originally invented by Lionel Penrose in 1946 and sometimes called Penrose–Banzhaf index; also known as the Banzhaf–Coleman index after James Samuel Coleman), is a power index defined by the probability of changing an outcome of a vote where voting rights are not necessarily equally divided among the voters or shareholders. To calculate the power of a voter using the Banzhaf index, list all the winning coalitions, then count the critical voters. A ''critical voter'' is a voter who, if he changed his vote from yes to no, would cause the measure to fail. A voter's power is measured as the fraction of all swing votes that he could cast. There are some algorithms for calculating the power index, e.g., dynamic programming techniques, enumeration methods and Monte Carlo methods. Examples Voting game Simple voting game A simple voting game, taken from ''Game Theory and Strategy'' by Philip D. Straffin: ; 4, 3, 2, 1 T ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Penrose Method
The Penrose method (or square-root method) is a method devised in 1946 by Professor Lionel Penrose for allocating the voting weights of delegations (possibly a single representative) in decision-making bodies proportional to the square root of the population represented by this delegation. This is justified by the fact that, due to the square root law of Penrose, the ''a priori'' voting power (as defined by the Penrose–Banzhaf index) of a member of a voting body is inversely proportional to the square root of its size. Under certain conditions, this allocation achieves equal voting powers for all people represented, independent of the size of their constituency. Proportional allocation would result in excessive voting powers for the electorates of larger constituencies. A precondition for the appropriateness of the method is ''en bloc'' voting of the delegations in the decision-making body: a delegation cannot split its votes; rather, each delegation has just a single vote to wh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bernoulli Trial
In the theory of probability and statistics, a Bernoulli trial (or binomial trial) is a random experiment with exactly two possible outcomes, "success" and "failure", in which the probability of success is the same every time the experiment is conducted. It is named after Jacob Bernoulli, a 17th-century Swiss mathematician, who analyzed them in his ''Ars Conjectandi'' (1713). The mathematical formalisation of the Bernoulli trial is known as the Bernoulli process. This article offers an elementary introduction to the concept, whereas the article on the Bernoulli process offers a more advanced treatment. Since a Bernoulli trial has only two possible outcomes, it can be framed as some "yes or no" question. For example: *Is the top card of a shuffled deck an ace? *Was the newborn child a girl? (See human sex ratio.) Therefore, success and failure are merely labels for the two outcomes, and should not be construed literally. The term "success" in this sense consists in the result ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Probability
Probability is the branch of mathematics concerning numerical descriptions of how likely an Event (probability theory), event is to occur, or how likely it is that a proposition is true. The probability of an event is a number between 0 and 1, where, roughly speaking, 0 indicates impossibility of the event and 1 indicates certainty."Kendall's Advanced Theory of Statistics, Volume 1: Distribution Theory", Alan Stuart and Keith Ord, 6th Ed, (2009), .William Feller, ''An Introduction to Probability Theory and Its Applications'', (Vol 1), 3rd Ed, (1968), Wiley, . The higher the probability of an event, the more likely it is that the event will occur. A simple example is the tossing of a fair (unbiased) coin. Since the coin is fair, the two outcomes ("heads" and "tails") are both equally probable; the probability of "heads" equals the probability of "tails"; and since no other outcomes are possible, the probability of either "heads" or "tails" is 1/2 (which could also be written ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stirling's Approximation
In mathematics, Stirling's approximation (or Stirling's formula) is an approximation for factorials. It is a good approximation, leading to accurate results even for small values of n. It is named after James Stirling, though a related but less precise result was first stated by Abraham de Moivre. One way of stating the approximation involves the logarithm of the factorial: \ln(n!) = n\ln n - n +O(\ln n), where the big O notation means that, for all sufficiently large values of n, the difference between \ln(n!) and n\ln n-n will be at most proportional to the logarithm. In computer science applications such as the worst-case lower bound for comparison sorting, it is convenient to use instead the binary logarithm, giving the equivalent form \log_2 (n!) = n\log_2 n - n\log_2 e +O(\log_2 n). The error term in either base can be expressed more precisely as \tfrac12\log(2\pi n)+O(\tfrac1n), corresponding to an approximate formula for the factorial itself, n! \sim \sqrt\left(\frac\righ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Council Of The European Union
The Council of the European Union, often referred to in the treaties and other official documents simply as the Council, and informally known as the Council of Ministers, is the third of the seven Institutions of the European Union (EU) as listed in the Treaty on European Union. It is one of two legislative bodies and together with the European Parliament serves to amend and approve or veto the proposals of the European Commission, which holds the right of initiative. The Council of the European Union and the European Council are the only EU institutions that are explicitly intergovernmental, that is, forums whose attendees express and represent the position of their Member State's executive, be they ambassadors, ministers or heads of state/government. The Council meets in 10 different configurations of national ministers (one per state). The precise membership of these configurations varies according to the topic under consideration; for example, when discussing agri ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Probability")
