Optimal Resource Allocation in Network Structures

Abstract

This article considers the resource allocation problem among several connected agents. An oriented graph without contours represents connections between agents. Any agent can get a resource only if all agents whose outputs connected to this agent’s input get a resource required. We describe two algorithms for this problem solving (exact and heuristic) and represent calculation examples.