{
  "id": 7000,
  "url": "https://arxiv.org/abs/2603.18999v1",
  "title": "Regret Bounds for Competitive Resource Allocation with Endogenous Costs",
  "summary": "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). Our main results esta",
  "authors": "Rui Chai",
  "category": "research",
  "topics": null,
  "orgs": null,
  "regions": null,
  "published_at": "2026-03-19T15:04:50.000Z",
  "fetched_at": "2026-07-14T16:32:54.533Z",
  "source_slug": "arxiv-ethics",
  "source_name": "arXiv",
  "source_homepage": "https://arxiv.org",
  "ethics_ai_record_url": "https://ethics.ai/record/7000",
  "original_url": "https://arxiv.org/abs/2603.18999v1",
  "evidence_status": "source-only",
  "attribution": "via ethics.ai"
}