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
Emery's rule rule. When the parasite is a close relative of the host but not its sister species, the relationship is in "loose" adherence to the rule. Emery's rule In 1909, the entomologist Carlo Emery noted that social parasites among insects (e.g., kleptoparasites) tend to be parasites of species or generation to which they are closely related. Over time, this pattern has been recognized in many additional cases, and generalized to what is now known as Emery's rule. The pattern is best known for various taxa of Hymenoptera. For example, the social wasp "Dolichovespula adulterina "parasitizes other members of its genus such