Об одной модели перераспределения ресурсов

Consider an economy with n resources (goods) and m agents, and let initial resource allocation be given. We ask if it is possible to build a mutually beneficial bargaining sequence that approaches an optimal resource allocation even though a) only k ≤ n agents participates at each step of the bargaining sequence, and b) they use only information about participants of the exchange. We answer this question using a new concept of quasi - summator functions. In particular, the answer is positive if k > n and all agent utility functions are concave.