Sanver, Mert Remzi2021-06-172021-06-172010-060165-1765https://hdl.handle.net/11411/3810https://doi.org/10.1016/j.econlet.2010.03.002We show that the Copeland solution is equivalent to the minisum principle which requires to choose the candidate(s) who beat all remaining contenders in the smallest total number of steps. © 2010 Elsevier B.V.eninfo:eu-repo/semantics/openAccessCopelandMinisumTournamentA characterization of the Copeland solutionArticle2-s2.0-7795254166110.1016/j.econlet.2010.03.002Q2WOS:000278042900012