We propose to choose this subset through a new technique. In particular, we design an algorithm that generates deterministic pseudorandom sequences with uniform behavior. Pseudorandomness is measured with a new notion called pseudo-entropy that determines the uniform character of the deterministic sequences. The communication phase is codified on a finite field with cardinality 2, meanwhile the verification phase is codified on one of cardinality 3. We get a better approximation to any feasible and rational payoff in the action space s convex hull.
Every signal has a different verification phase and a common regular play.