Metraipolis › archive › dc_a85b4e350651
Distributed Algorithms for $α$-Potential Functions in General-Sum Games — arXiv:2610.05516
- Source
- arXiv
- Original
- https://arxiv.org/abs/2610.05516
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T05:23:53.186Z
- SHA-256 of the archived text
10cacd48b7532cb7568cd7b4294b4b7e8592d5373c8047232eda2bb79ba30130- Stable URL of this page
https://metraipolis.com/documento/dc_a85b4e350651
How to cite
Distributed Algorithms for $α$-Potential Functions in General-Sum Games — arXiv:2610.05516 — arXiv, https://arxiv.org/abs/2610.05516 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a85b4e350651 (Metraipolis archive dc_a85b4e350651, sha256 10cacd48b7532cb7568cd7b4294b4b7e8592d5373c8047232eda2bb79ba30130)
BibTeX
@misc{dca85b4e350651,
title = {Distributed Algorithms for $α$-Potential Functions in General-Sum Games — arXiv:2610.05516},
howpublished = {arXiv},
url = {https://arxiv.org/abs/2610.05516},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a85b4e350651; sha256 10cacd48b7532cb7568cd7b4294b4b7e8592d5373c8047232eda2bb79ba30130},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.05516. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the problem of computing the tightest \(\alpha\)-potential approximation of a general-sum game over continuous action spaces, within a prescribed class of potential functions and when each player has access only to its own utility function. The difficulty is twofold: the approximation error involves a worst-case search over an infinite set of unilateral deviations, and the required utility information is distributed across players. For a linear-in-parameters potential class, we use an exact finite-tuple reformulation that separates the problem into a global outer search over deviation tuples and distributed convex inner problems. We develop a primal--dual inner oracle tailored to this structure and establish a uniform one-sided accuracy guarantee. This oracle can be combined with global outer search to obtain an end-to-end guarantee on the outer optimization error. We also develop a projected zeroth-order outer method as a computationally lighter alternative for higher-dimensional problems. Numerical experiments illustrate the accuracy--computation tradeoff between the two outer-search methods and show that the proposed optimization framework can improve upon analytical \(\alpha\)-potential constructions. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.MA, nuovi lavori del giorno). Categorie arXiv: Multiagent Systems (cs.MA) ; Computer Science and Game Theory (cs.GT); Systems and Control (eess.SY); Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.05516 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T05:23:50.207Z dalla pagina https://arxiv.org/list/cs.MA/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).