Abstract:
Graph-cominant and tournament choice mechanisms and the choice functions generated by then are compared. Some tournament mechanisms are shown to be equivalently representably by graph-dominant mechanisms and some of the latter, by the former.