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
Chatham House Rule so that better international relations may be achieved. The rule is now used internationally as an aid to free discussion. The original rule of 1927 was refined in October 1992 and again in 2002. Chatham House has translated the rule into Arabic, Chinese, French, German, Portuguese, Spanish and Russian. The rule is a contrast (or a compromise) between private meetings, where revealing what was said in the meeting is forbidden, and "on the record" events where the discussion is completely public and attributed. Generally, the Chatham House Rule is imposed as a condition of being allowed to attend a meeting