Computationally-efficient resource allocation

This invention describes a computer method to efficiently match things that need resources (like computing jobs or teams) with available resources (like processors or shared workspaces). It starts by arranging the things needing resources on a virtual map using a physics-like simulation. This map then guides an initial setup on a second, more complex graph. Finally, the things needing resources virtually move around this second graph, expanding until they find and claim the necessary resources. The claims specifically focus on matching entities where the second entity provides physical, on-demand shared resources in a workspace.