Choices and kernels in bipolar valued digraphs

We explore the extension of the notion of kernel (independent, dominant or absorbent, non-empty subset) of a digraph to valued graphs (or valued relations). We define various natural extensions and show the relationship between them. This work has potential interest for applications in choice decision problems.