Research map / Multi-agent systems and games / Games and equilibria
Topological Distance Games
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 |
|---|---|---|---|
| Require symmetric inherent utilities | Topological distance games with any distance factor function · General topology graphs | jump-stable assignment existence | Helped |
| Use symmetric inherent utilities | Finding a jump-stable assignment in topological distance games · General topology graphs | computational complexity | Mixed |
| Allow asymmetric utilities on a connected topology graph of diameter at least 3 | Topological distance games · Two-agent instances | jump-stable assignment existence | Hurt |
| Require non-negative utilities and an acyclic friendship graph | Topological distance games with any distance factor function · General topology graphs | jump-stable assignment existence | Helped |
| Use a cycle topology with at most one friend per agent, excluding friendship cycles of length 3 or 5 | Topological distance games with non-negative utilities · Cycle topology | jump-stable assignment existence | Helped |
| Use a path topology and allow each agent at most two friends | Topological distance games with non-negative utilities · Path topology | jump-stable assignment existence | Helped |
| Use a tree topology with binary utilities and a cyclic friendship graph | Topological distance games · Tree topology | jump-stable assignment existence | Hurt |
| Use an extended-star topology with k branches and at least 5k+1 agents | Topological distance games with non-negative utilities and a cyclic friendship graph · Extended-star topology | jump-stable assignment existence | Helped |
| Require an acyclic friendship graph and non-negative utilities | Beneficial-jump dynamics in topological distance games · General topology graphs | dynamics convergence | Helped |
| Allow beneficial jumps to proceed under the acyclic, non-negative-utility conditions | Topological distance games · General topology graphs | number of dynamics steps: 2^k | Hurt |
| Use the reciprocal distance factor function | Deciding whether a jump-stable assignment exists · Topological distance games with a constant number of connected components and |V| = Θ(n) | computational complexity | Hurt |
| Use symmetric utilities | Jump dynamics in topological distance games · General topology graphs | dynamics convergence | Helped |
Closest papers by meaning
- On Pareto Optimality in Social Distance Games (AAAI 2017 · similarity 0.90)
- Nash Stability in Social Distance Games (AAAI 2017 · similarity 0.90)
- Swap Stability in Schelling Games on Graphs (AAAI 2020 · similarity 0.88)
- Graphical Hedonic Games of Bounded Treewidth (AAAI 2016 · similarity 0.88)
- Stability in Online Coalition Formation (AAAI 2024 · similarity 0.87)
- Individually Stable Dynamics in Coalition Formation over Graphs (AAAI 2025 · similarity 0.87)
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.