Papers for

distributed software developers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Decentralized data control protects shared info without a central boss

GUARDTs: Decentralized Access Control for Replicated Data Types

Abstract: Replicated data types providing strong eventual consistency offer a principled foundation for developing decentralized software. Yet existing approaches to programming such data types leave access control unresolved: they either provide none at all, delegate it to a trusted coordinator, reintroducing the centralization they were designed to avoid, or tie it to specific data-type constructions, while typically assuming non-Byzantine replicas and static policies. We present GUARDTs: Guarded Unforgeable Algebraic Replicated Data Types, which embed fine-grained permissions directly into the application data model, operate without a central authority, support dynamic policy evolution, and tolerate Byzantine replicas. We formally prove that GUARDTs guarantee confidentiality, integrity, and availability and show empirically that their access control adds negligible overhead on top of the cost of Byzantine-resilient replication itself.

Thu 5 NovProgramming LanguagesDistributed, Parallel, and Cluster Computing
The gist
Managing who can see or change shared data without a central controller is a tricky problem, especially when data is copied across many places. The authors present a new way to build data structures that keep track of permissions inside the data itself. This method works even if some copies act badly or policies change over time. Their approach keeps data secure and available, and adding this security doesn’t slow things down much.
Open → 2611.08083v1

Multi-agent coordination improves with responsibility-centered commitments

A Responsibility-Centered Coordination Mechanism for Decentralized Multi-Agent Systems

Abstract: Centralized orchestration provides comprehensive multi-agent coordination but creates bottlenecks in scalability, adaptability, and collective performance. Decentralized approaches alleviate these bottlenecks by distributing coordination across agents, yet often leave responsibility for delegated dependencies and failure recovery unclear. To address this gap, we propose RCM, a responsibility-centered coordination mechanism that leverages commitments to couple task delegation with explicit responsibilities of the involved parties. Through recursive delegation, agents retain their upstream responsibilities while locally orchestrating downstream commitments, thereby preserving accountability across delegation chains, creating a network of local orchestration. We operationalize this mechanism locally through responsibility-constrained decision-making and a responsibility-oriented communication protocol (RCP), enabling agents to autonomously establish, manage, and terminate commitments. As agents act in parallel, their local actions continuously evolve the commitment graph, allowing global coordination to emerge and adapt toward a shared mission without centralized control. Experiments across reasoning, coding, and executable agent environments demonstrate that RCM outperforms strong centralized and decentralized coordination baselines by up to 18.7 points in task performance and 10.2 points in Responsibility, while improving failure and harm detection without task-specific training.

Thu 15 OctMultiagent SystemsArtificial Intelligence
The gist
Coordinating many agents (like robots or software programs) is tricky because centralized control can get overwhelmed, while fully decentralized setups can lose track of who is responsible for tasks. The authors propose a new method called RCM that ties task delegation to clear responsibilities using commitments between agents. This way, even when tasks are handed down many times, everyone stays accountable, and agents coordinate on their own without a central boss. Tests showed RCM leads to better task success and detects failures more reliably than existing approaches.
Open → 2610.21243v1