Uniform resource networks I. Complete graphs

A bidirectional resource network is a directed graph in which any two vertices $v_i$, $v_j$ are either not adjacent or are connected by a pair of edges $(v_i,v_j)$, $(v_j,v_i)$. Non-negative numbers (resources) are assigned to vertices. The rules of functioning for such networks are formulated and processes of resource distribution in bidirectional networks represented by complete graphs are considered. It is shown that limit states of such networks do not depend on initial resource distributions.