Metraipolis › archive › dc_a22a05656eb8

Graphon Design for Human-Machine Coordination under Bounded Rationality: Optimality of Stochastic Block Models — arXiv:2608.27851

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.27851
License (as archived)
CC0-1.0
Archived
2026-10-17T10:57:09.935Z
SHA-256 of the archived text
b0b22557734b9041720f7bd055fa55fb1136ac357fdbd3daedda7b98523e5795
Stable URL of this page
https://metraipolis.com/documento/dc_a22a05656eb8

How to cite

Graphon Design for Human-Machine Coordination under Bounded Rationality: Optimality of Stochastic Block Models — arXiv:2608.27851 — arXiv (en), https://arxiv.org/abs/2608.27851 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a22a05656eb8 (Metraipolis archive dc_a22a05656eb8, sha256 b0b22557734b9041720f7bd055fa55fb1136ac357fdbd3daedda7b98523e5795)
BibTeX
@misc{dca22a05656eb8,
  title = {Graphon Design for Human-Machine Coordination under Bounded Rationality: Optimality of Stochastic Block Models — arXiv:2608.27851},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.27851},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a22a05656eb8; sha256 b0b22557734b9041720f7bd055fa55fb1136ac357fdbd3daedda7b98523e5795},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.27851. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Coordination is a desirable feature in multi-agent systems, ranging from robotic swarms to socioeconomic networks. This paper is concerned with promoting coordination among heterogeneous agents, e.g., machines and humans, interacting in a stag-hunt game. In our model the agents exhibit bounded rationality at different levels, which leads to uncertainty and a propensity for errors during learning and decision-making processes. This paper addresses the problem of designing a network topology that maximizes a global metric of coordination under such constraints. While optimizing over the discrete space of finite graphs is generally computationally intractable, we employ a mean-field approach to lift the problem into the space of graphons. Within this framework, we analyze agents following a logit learning dynamics. Using calculus of variations, we show that for systems with a bimodal rationality profile, it suffices to search for optimal graphons in the ensemble of stochastic block models. We then propose a water-filling algorithm to find a locally optimal graphon. Finite graphs can then be sampled from the optimized graphon, bypassing the inherent combinatorial complexities of discrete graph optimization.

Tema degli esploratori: economia dei servizi IA (retro-catalogo arXiv: annunci del 2026-08-31 in cs.GT).
Categorie arXiv: Systems and Control (eess.SY) ; Computer Science and Game Theory (cs.GT).
Pagina del lavoro: https://arxiv.org/abs/2608.27851 — 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-17T10:48:51.065Z dalla pagina https://arxiv.org/catchup/cs.GT/2026-08-31?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).