Aug 2026· Proceedings of the 32nd ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2· pp. 3715-3726· 0 citations· 37 references
TL;DR
This work proposes PG-DyRA, a decentralized coordination framework that operates under partial observability without inter-agent communication, and designs a marginal contribution utility under which the resulting game admits pure strategy Nash equilibria that coincide with the global optimum.
Abstract
Efficient allocation of urban public resources such as transportation, logistics, and emergency response is crucial for modern cities to maintain operational efficiency and service equity. This task requires coordinating multiple mobile units to serve spatiotemporally heterogeneous demands under coupled physical constraints such as finite service capacity, energy budgets, and mobility ranges. Beyond physical limitations, practical deployments also impose information constraints: sensing costs, communication bandwidth, and privacy regulations restrict each agent to observing only nearby peers, yet effective coordination demands reasoning about unobserved actions across the entire system. We propose PG-DyRA, a decentralized coordination framework that operates under partial observability without inter-agent communication. Building on a potential game perspective, we design a marginal contribution utility under which the resulting game admits pure strategy Nash equilibria that coincide with the global optimum, providing a theoretically grounded coordination signal for independent decision-making. To operationalize this signal under this observability constraint, we develop a dual-branch intention inference network that estimates other agents' service capacity allocation from local observations, with one branch modeling visible agents via trajectory-based state bank alignment and the other inferring invisible agents from demand residuals. Experiments on four urban datasets demonstrate that PG-DyRA achieves 2.23-8.04 percentage points higher task coverage rates while reducing energy consumption by 2.99-8.35 percentage points compared to the state-of-the-art methods.
Extensive computational experiments demonstrate that DCFA scales near-linearly with problem size and occupies the optimal compromise point on the utility–time Pareto frontier, achieving order-of-magnitude speedups relative to leading centralized metaheuristics at negligible solution-quality loss.
Jie Gu, Xin-Wang Song, Jian Ge et al.· International Journal of Ind...· 0 citations
Distributed network security requires multiple defenders to make coupled resource allocation and coordination decisions under limited budgets, connectivity-dependent risks, and non-negligible coordination costs. We develop a mathematical framework for jointly optimizing defensive resource allocation and coalition forma...
Ru-Fan Bai, Shuo-Tian Lin, Xin-Yang Liu et al.· Mathematics· 0 citations
We study noncooperative multi-vehicle games among heterogeneous autonomous vehicles, where each vehicle adopts a decentralized closed-loop policy based on its own state, and optimizes an objective that depends on other vehicles through potentially asymmetric interaction weights. We develop an $\alpha$-potential game fr...
An-Ran Hu, Zhe-Xin Wang, Yu-Fei Zhang et al.· 0 citations
This paper proposes a heterogeneous multi-agent proximal policy optimization (MAPPO)-based framework where both user devices and UAVs act as heterogeneous agents and utilizes a centralized training and decentralized execution (CTDE) paradigm to enable collaborative strategies between computing requesters and providers.
Ming Cheng, Canlin Zhu, Jian-Hang Tang et al.· Journal of King Saud Univers...· 0 citations
The chance-constrained correlated equilibrium concept provides a robust coordination technique for self-interested agents whose costs are uncertain to a central coordinator, but the number of joint actions considered in its computation grows exponentially with the number of agents. We propose an exact-one resource-assi...
Jaehan Im, U. Topcu, David Fridovich-Keil· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.