In the Value-Added Network (VAN) environment Dijkstra's Dining Philosopher Problem" is extended to a social resource acquisition problem of entrepreneurs and craftsmen where the formers wish to employ, for their projects at hand, certain sets of craftsmen of requisite skills and the latters wish to maximize their chance of employment. This paper sets up a framework of rules for the solution process that compromise conflicts of personal interests, designs communication protocols for message exchanges, and proposes a decentralized on-line algorithm for guiding individual participants toward their own benefits while assuring the solvability of the problem. Although propagation of messages through VAN are restricted in order to reflect an indefinite nature of participation and protection of privacy, the proposed algorithm is capable of activating the maximum number of concurrent resource aquisition as the present conflicting-situation allows.