The Copeland choice function an axiomatic characterization

We give a generalization of Copeland Scroes in a set of alternatives endowed with a complete binary relation. We then first study the links between Copeland scores and cycles. We provide a full axiomatic characterization for the Copeland choice rule and the Copeland ranking method.