Dear Forest, you wrote: > The following "chain climbing" method devised by Jobst Heitzig > satisfies the Chicken Dilemma criterion, is monotonic, clone > proof, and elects only uncovered candidates (in fact from the > Banks set). Can you prove these claims? Markus Schulze