On Some Fundamental Problems for Multi-Agent Systems Over Multilayer Networks
Fuente:
arXiv
Saved in:
| Main Authors: | Rosenkrantz, Daniel J., Marathe, Madhav V., Qiu, Zirou, Ravi, S. S., Stearns, Richard E. |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks
by: Qiu, Zirou, et al.
Published: (2024)
by: Qiu, Zirou, et al.
Published: (2024)
Eliminating Illusion in Directed Networks
by: Jana, Sougata, et al.
Published: (2026)
by: Jana, Sougata, et al.
Published: (2026)
Search versus Search for Collapsing Electoral Control Types
by: Carleton, Benjamin, et al.
Published: (2022)
by: Carleton, Benjamin, et al.
Published: (2022)
Anyone but Him: The Complexity of Precluding an Alternative
by: Hemaspaandra, Edith, et al.
Published: (2005)
by: Hemaspaandra, Edith, et al.
Published: (2005)
Introducing The Maximum Common Bigraph Problem
by: Burns, Kyle, et al.
Published: (2026)
by: Burns, Kyle, et al.
Published: (2026)
Model Checking of vGOAL
by: Yang, Yi, et al.
Published: (2024)
by: Yang, Yi, et al.
Published: (2024)
I Would If I Could: Reasoning about Dynamics of Actions in Multi-Agent Systems
by: Galimullin, Rustam, et al.
Published: (2026)
by: Galimullin, Rustam, et al.
Published: (2026)
Reachability with Restricted Reactions in Inhibitory Chemical Reaction Networks
by: Bajaj, Divya, et al.
Published: (2026)
by: Bajaj, Divya, et al.
Published: (2026)
Polynomial-time Tractable Problems over the $p$-adic Numbers
by: Fehm, Arno, et al.
Published: (2025)
by: Fehm, Arno, et al.
Published: (2025)
Graph-Based Deterministic Polynomial Framwork for NP Problems
by: Lee, Changryeol
Published: (2025)
by: Lee, Changryeol
Published: (2025)
Correspondences in computational and dynamical complexity II: forcing complex reductions
by: Everett, Samuel
Published: (2026)
by: Everett, Samuel
Published: (2026)
Information Theoretic Optimal Surveillance for Epidemic Prevalence in Networks
by: Mishra, Ritwick, et al.
Published: (2026)
by: Mishra, Ritwick, et al.
Published: (2026)
Multi-Agent Path Finding For Large Agents Is Intractable
by: Agafonov, Artem, et al.
Published: (2025)
by: Agafonov, Artem, et al.
Published: (2025)
On the Counting Complexity of the Skolem Problem
by: Jindal, Gorav, et al.
Published: (2024)
by: Jindal, Gorav, et al.
Published: (2024)
Pramana: A Protocol-Layer Treatment of Claim Verification in Autonomous Agent Networks
by: Kadaboina, Ravi Kiran
Published: (2026)
by: Kadaboina, Ravi Kiran
Published: (2026)
A Two-Stage Reactive Auction Framework for the Multi-Depot Rural Postman Problem with Dynamic Vehicle Failures
by: Sathyamurthy, Eashwar, et al.
Published: (2024)
by: Sathyamurthy, Eashwar, et al.
Published: (2024)
Changing the Rules of the Game: Reasoning about Dynamic Phenomena in Multi-Agent Systems
by: Galimullin, Rustam, et al.
Published: (2025)
by: Galimullin, Rustam, et al.
Published: (2025)
Catalytic Computing and Register Programs Beyond Log-Depth
by: Alekseev, Yaroslav, et al.
Published: (2025)
by: Alekseev, Yaroslav, et al.
Published: (2025)
A point to set principle for finite-state dimension
by: Mayordomo, Elvira
Published: (2022)
by: Mayordomo, Elvira
Published: (2022)
InfluenceNet: AI Models for Banzhaf and Shapley Value Prediction
by: Kempinski, Benjamin, et al.
Published: (2025)
by: Kempinski, Benjamin, et al.
Published: (2025)
Learning Symbolic Task Decompositions for Multi-Agent Teams
by: Shah, Ameesh, et al.
Published: (2025)
by: Shah, Ameesh, et al.
Published: (2025)
$\rm P$ has polynomial-time finite-state verifiers
by: Gezer, M. Utkan, et al.
Published: (2023)
by: Gezer, M. Utkan, et al.
Published: (2023)
Networked Anti-Coordination Games Meet Graphical Dynamical Systems: Equilibria and Convergence
by: Qiu, Zirou, et al.
Published: (2023)
by: Qiu, Zirou, et al.
Published: (2023)
Separation Results for Constant-Depth and Multilinear Ideal Proof Systems
by: Behera, Amik Raj, et al.
Published: (2026)
by: Behera, Amik Raj, et al.
Published: (2026)
The Bit Complexity of Dynamic Algebraic Formulas and their Determinants
by: Anand, Emile, et al.
Published: (2024)
by: Anand, Emile, et al.
Published: (2024)
Tight bounds on depth-2 QAC-circuits computing parity
by: Fenner, Stephen, et al.
Published: (2025)
by: Fenner, Stephen, et al.
Published: (2025)
Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
by: de Rezende, Susanna F., et al.
Published: (2026)
by: de Rezende, Susanna F., et al.
Published: (2026)
Partial gathering of mobile agents in dynamic rings
by: Shibata, Masahiro, et al.
Published: (2022)
by: Shibata, Masahiro, et al.
Published: (2022)
Arithmetic Complexity of Solutions of the Dirichlet Problem
by: Boche, Holger, et al.
Published: (2026)
by: Boche, Holger, et al.
Published: (2026)
On the Complexity of Determinations
by: Hellerstein, Joseph M.
Published: (2026)
by: Hellerstein, Joseph M.
Published: (2026)
Towards New Characterizations of Small Circuit Classes via Discrete Ordinary Differential Equations
by: Antonelli, Melissa, et al.
Published: (2025)
by: Antonelli, Melissa, et al.
Published: (2025)
Complexity Classes Arising from Circuits over Finite Algebraic Structures
by: Kawałek, Piotr, et al.
Published: (2026)
by: Kawałek, Piotr, et al.
Published: (2026)
Nonuniform Deterministic Finite Automata over finite algebraic structures
by: Idziak, Paweł M., et al.
Published: (2025)
by: Idziak, Paweł M., et al.
Published: (2025)
Advanced Game-Theoretic Frameworks for Multi-Agent AI Challenges: A 2025 Outlook
by: Malinovskiy, Pavel
Published: (2025)
by: Malinovskiy, Pavel
Published: (2025)
Assigning Agents to Increase Network-Based Neighborhood Diversity
by: Qiu, Zirou, et al.
Published: (2023)
by: Qiu, Zirou, et al.
Published: (2023)
Learning the Topology and Behavior of Discrete Dynamical Systems
by: Qiu, Zirou, et al.
Published: (2024)
by: Qiu, Zirou, et al.
Published: (2024)
Algorithmic hardness of the partition function for nucleic acid strands
by: Ducloz, Gwendal, et al.
Published: (2025)
by: Ducloz, Gwendal, et al.
Published: (2025)
Realizable Circuit Complexity: Embedding Computation in Space-Time
by: Prada, Benjamin, et al.
Published: (2025)
by: Prada, Benjamin, et al.
Published: (2025)
Finding Nontrivial Minimum Fixed Points in Discrete Dynamical Systems
by: Qiu, Zirou, et al.
Published: (2023)
by: Qiu, Zirou, et al.
Published: (2023)
Thurston's pullback map, invariant covers, and the global dynamics on curves
by: Bonk, Mario, et al.
Published: (2024)
by: Bonk, Mario, et al.
Published: (2024)
Similar Items
-
Efficient PAC Learnability of Dynamical Systems Over Multilayer Networks
by: Qiu, Zirou, et al.
Published: (2024) -
Eliminating Illusion in Directed Networks
by: Jana, Sougata, et al.
Published: (2026) -
Search versus Search for Collapsing Electoral Control Types
by: Carleton, Benjamin, et al.
Published: (2022) -
Anyone but Him: The Complexity of Precluding an Alternative
by: Hemaspaandra, Edith, et al.
Published: (2005) -
Introducing The Maximum Common Bigraph Problem
by: Burns, Kyle, et al.
Published: (2026)