Conflicting Bundle Allocation with Preferences in Weighted Directed Acyclic Graphs: Application to Orbit Slot Allocation Problems

We introduce resource allocation techniques for problems where (i) the agents express requests obtaining item bundles as compact edge-weighted directed acyclic graphs (each path in such a graph is bundle whose valuation sum of weights traversed edges), and (ii) do not bid on exact same items but may conflicting that cannot be both assigned or require accessing specific with limited capacity. This setting motivated by real applications Earth observation slot allocation, virtual network functions, multi-agent finding. model several (vertex-constrained resource-constrained), investigate solution methods (qualified approximate, utilitarian fair), analyze their performances an orbit ownership problem, realistic constellation configurations.