Research map / Multi-agent systems and games / Games and equilibria
Networked Anti-coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use self-non-essential rather than self-essential decisions | Anti-coordination games, sequential and synchronous · NE existence and finding | computational complexity: NP-hard -> P | Helped |
| Use self-non-essential rather than self-essential decisions | Synchronous anti-coordination games · Limit-cycle convergence | worst-case convergence steps: O(m) -> O(m) | No clear effect |
| Use self-non-essential rather than self-essential decisions | Sequential anti-coordination games · Limit-cycle convergence | worst-case convergence steps: NA -> O(m) | Helped |
| Use self-non-essential rather than self-essential decisions | Synchronous anti-coordination games · Small-world | average convergence steps: 14.41 -> 12.71 | Helped |
| Use self-non-essential rather than self-essential decisions | Synchronous anti-coordination games · Scale-free | average convergence steps: 12.78 -> 11.66 | Helped |
| Use self-non-essential rather than self-essential decisions | Synchronous anti-coordination games · Gnp | average convergence steps: 13.09 -> 12.71 | Helped |
| Use self-non-essential rather than self-essential decisions | Synchronous anti-coordination games · astroph | average convergence steps: 17.31 -> 13.72 | Helped |
| Use self-non-essential rather than self-essential decisions | Synchronous anti-coordination games · google+ | average convergence steps: 7.36 -> 7.05 | Helped |
| Use self-non-essential rather than self-essential decisions | Synchronous anti-coordination games · Deezer | average convergence steps: 14.41 -> 12.29 | Helped |
| Increase network density | Synchronous SE anti-coordination dynamics · Gnp networks | average convergence time | Hurt |
| Increase network density | Synchronous SN anti-coordination dynamics · Gnp networks | average convergence time | No clear effect |
| Use self-non-essential rather than self-essential decisions | Anti-coordination games · Gnp, 20 vertices, average degree 4 | instances with at least one NE: 710 -> 20,000 | Helped |
Closest papers by meaning
- Evolutionary Game Theory Squared: Evolving Agents in Endogenously Evolving Zero-Sum Games (AAAI 2021 · similarity 0.89)
- The Complexity of Optimizing Atomic Congestion (AAAI 2024 · similarity 0.86)
- Stability of Multi-Agent Learning in Competitive Networks: Delaying the Onset of Chaos (AAAI 2024 · similarity 0.86)
- Individually Stable Dynamics in Coalition Formation over Graphs (AAAI 2025 · similarity 0.86)
- Synchronization in Learning in Periodic Zero-Sum Games Triggers Divergence from Nash Equilibrium (AAAI 2025 · similarity 0.86)
- Strategic Network Creation for Enabling Greedy Routing (AAAI 2025 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.