AI RESEARCH
Regret Bounds for Competitive Resource Allocation with Endogenous Costs
arXiv CS.AI
•
ArXi:2603.18999v1 Announce Type: new We study online resource allocation among N interacting modules over T rounds. Unlike standard online optimization, costs are endogenous: they depend on the full allocation vector through an interaction matrix W encoding pairwise cooperation and competition. We analyze three paradigms: (I) uniform allocation (cost-ignorant), (II) gated allocation (cost-estimating), and (III) competitive allocation via multiplicative weights update with interaction feedback (cost-revealing.