[EM] AP Chain Climbing 2.0

[Forest Simmons]

This procedure is composed of two sub-procedures ... one to construct an
"advanced placement" chain headed by the most favorable agenda item ... and
another to complete the chain by a process of chain climbing.

First sub-procedure: initialize a chain 'c' as the empty set. Then while
there exists (even vacuously) some agenda item that is defeated by every
member of 'c', incorporate the most favorable such item into 'c'.

Final sub-procedure: while any agenda item defeats every member of 'c',
incorporate the most favorable such item into 'c'.

After executing both sub-procedures, elect the head of the finished chain.

This method is definitely Banks efficient. I'm pretty sure that it is also
monotonic and (unlike ordinary chain climbing) Independent from Pareto
Dominated Alternatives (IPDA).

I'll send proof sketches soon (if it continues to hold up).

-Forest
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20220727/e8c2e956/attachment.htm>