Making choices with a binary relation: Relative choice axioms and transitive closures

This article presents an axiomatic analysis of the best choice decision problem from a reflexive crisp binary relation on a finite set (a digraph). With respect to a transitive digraph, optimality and maximality are usually accepted as the best fitted choice axioms to the intuitive notion of best choice. However, beyond transitivity (resp. acyclicity), optimality and maximality can characterise distinct choice sets (resp. empty sets). Accordingly, different and rather unsatisfying concepts have appeared, such as von Neumann-Morgenstern domination, weak transitive closure and kernels. Here, we investigate a new family of eight choice axioms for digraphs: relative choice axioms. Within choice theory, these axioms generalise top-cycle for tournaments, gocha, getcha and rational top-cycle for complete digraphs. We present their main properties such as existence, uniqueness, idempotence, internal structure, and cross comparison. We then show their strong relationship with optimality and maximality when the latter are not empty. Otherwise, these axioms identify a non-empty choice set and underline conflicts between chosen elements in strict preference circuits. Finally, we exploit the close link between this family and transitive closures to compute choice sets in linear time, followed by a relevant practical application.