The complexity is in the external entropy of the game theory.
What is "external entropy of the game theory"? Was it defined upthread?
It is the entropy or Kolmogorov complexity of all possible selection algorithms and the game theory of when to use them. It might even be infinite. There is no way to prove I think. This is a result of not having a single LCR. Thus your algorithm is open to unbounded probabilities analysis.