Abstract:
The reported procedures of choosing the best options are described where on a set of options a binary preference relation (directed graph) is specified and the choice is dictated by this relation. Special treatment is given to choice procedures in the case where the binary relation is asymmetrical and complete, or is a tournament.