Abstract:
A possible planning mechanism is considered for allocation of a single-dimensional resource in an active system with a two way flow of data on elements to the center. On receiving the data the center updates the plan of resource allocation so as maxi mize its gains and elements choose and report challenge plans allowing for their possible correction by the center. Effectiveness of the planning mechanism is estimated.