Cunningham's Rule constructions because they tend to average out how many times a variable pivots. It has recently been shown by David Avis and Oliver Friedmann that there is a family of linear programs on which the simplex algorithm equipped with Cunningham's rule requires exponential time. Cunningham's Rule In mathematical optimization, Cunningham's rule (also known as least recently considered rule or round-robin rule) is an algorithmic refinement of the simplex method for linear optimization. The rule was proposed 1979 by W.H. Cunningham to defeat the deformed hypercube constructions by Klee and Minty et. al. (see, e.g. Klee–Minty cube). Cunningham's rule assigns a
Majority rule circumstances, such as a two-thirds rule to close debate. Many referendums are decided by majority rule. According to May, majority rule is the only reasonable decision rule that is "fair", that is, that does not privilege voters by letting some votes count for more or privilege an alternative by requiring fewer votes for its passing. Stated more formally, majority rule is the only binary decision rule that has the following properties: Strictly speaking, it has been shown that majority rule meets these criteria only if the number of voters is odd or infinite. If the number of voters is even,