Reinforced dynamics for interacting agents in competitive or cooperative environments
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908543274188800 |
|---|---|
| author | Aleandri, Michele Pra, Paolo Dai Minelli, Ida Germana |
| author_facet | Aleandri, Michele Pra, Paolo Dai Minelli, Ida Germana |
| contents | We study systems of interacting reinforced stochastic processes, where agents' decisions evolve under reinforcement, network-mediated interactions, and environmental influences. In competitive environments with irreducible networks, we prove almost sure convergence of agents' states, with bipartite graphs leading to non-deterministic limits and non-bipartite graphs to deterministic ones. These results are extended to reducible networks with cooperative or competitive substructures, using a hierarchical graph representation in which higher-level agents perceive lower-level agents as forcing inputs. A general framework for interacting agents under external forcing is also provided, offering a rigorous characterization of long-term behavior and synchronization phenomena in such systems. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_13493 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Reinforced dynamics for interacting agents in competitive or cooperative environments Aleandri, Michele Pra, Paolo Dai Minelli, Ida Germana Probability 60F15, 60K35, 62L20, 91D30 We study systems of interacting reinforced stochastic processes, where agents' decisions evolve under reinforcement, network-mediated interactions, and environmental influences. In competitive environments with irreducible networks, we prove almost sure convergence of agents' states, with bipartite graphs leading to non-deterministic limits and non-bipartite graphs to deterministic ones. These results are extended to reducible networks with cooperative or competitive substructures, using a hierarchical graph representation in which higher-level agents perceive lower-level agents as forcing inputs. A general framework for interacting agents under external forcing is also provided, offering a rigorous characterization of long-term behavior and synchronization phenomena in such systems. |
| title | Reinforced dynamics for interacting agents in competitive or cooperative environments |
| topic | Probability 60F15, 60K35, 62L20, 91D30 |
| url | https://arxiv.org/abs/2509.13493 |