Sync or Sink: Bounds on Algorithmic Collective Action with Noise and Multiple Groups

• URL: http://arxiv.org/abs/2510.18933v1
• Date: Tue, 21 Oct 2025 17:26:19 GMT
• Title: Sync or Sink: Bounds on Algorithmic Collective Action with Noise and Multiple Groups
• Authors: Aditya Karan, Prabhat Kalle, Nicholas Vincent, Hari Sundaram,
• Abstract summary: We provide guarantees on the success of collective action in the presence of both coordination noise and multiple groups.<n>We find that sufficiently high levels of noise can reduce the success of collective action.<n>This work highlights the importance of understanding nuanced dynamics of strategic behavior in algorithmic systems.
• Score: 8.67236066491665
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Collective action against algorithmic systems, which enables groups to promote their own interests, is poised to grow. Hence, there will be growth in the size and the number of distinct collectives. Currently, there is no formal analysis of how coordination challenges within a collective can impact downstream outcomes, or how multiple collectives may affect each other's success. In this work, we aim to provide guarantees on the success of collective action in the presence of both coordination noise and multiple groups. Our insight is that data generated by either multiple collectives or by coordination noise can be viewed as originating from multiple data distributions. Using this framing, we derive bounds on the success of collective action. We conduct experiments to study the effects of noise on collective action. We find that sufficiently high levels of noise can reduce the success of collective action. In certain scenarios, large noise can sink a collective success rate from $100\%$ to just under $60\%$. We identify potential trade-offs between collective size and coordination noise; for example, a collective that is twice as big but with four times more noise experiencing worse outcomes than the smaller, more coordinated one. This work highlights the importance of understanding nuanced dynamics of strategic behavior in algorithmic systems.

Related papers

• Crab$^{+}$: A Scalable and Unified Audio-Visual Scene Understanding Model with Explicit Cooperation [83.75249714794977]
  We present Crab$+$, a scalable and unified audio-visual scene understanding model.<n>On the data side, we introduce AV-UIE v2, a comprehensive Audio-Visual Unified Instruction-tuning dataset.<n>On the model side, we design a unified interface to align heterogeneous task formulations.<n>We successfully reverse the negative transfer trend, achieving positive transfer where multi-task learning surpasses single-task baselines in nearly 88% of tasks.
  arXiv  Detail & Related papers  (2026-03-04T14:43:57Z)
• Group size effects and collective misalignment in LLM multi-agent systems [0.0874967598360817]
  We show that collective bias is a deeper phenomenon than previously assessed.<n>We demonstrate that group size affects the dynamics in a non-linear way.<n>These findings establish group size as a key driver of multi-agent dynamics.
  arXiv  Detail & Related papers  (2025-10-25T19:45:45Z)
• Algorithmic Collective Action with Multiple Collectives [10.953526453057579]
  Algorithmic Collective Action (ACA)-coordinated changes to shared data-offers a complement to regulator-side policy and firm-side model design.<n>Most ACA literature focused on single collective settings.<n>We present the first theoretical framework for ACA with multiple collectives acting on the same system.
  arXiv  Detail & Related papers  (2025-08-26T16:00:08Z)
• Collaborative Min-Max Regret in Grouped Multi-Armed Bandits [6.675805308519987]
  We study the impact of sharing exploration in multi-armed bandits in a grouped setting.<n>We introduce an algorithm that dynamically coordinates exploration across groups.
  arXiv  Detail & Related papers  (2025-06-12T02:56:35Z)
• Algorithmic Collective Action with Two Collectives [18.045224609703897]
  We introduce a first of a kind framework for studying collective action with two or more collectives.<n>We examine how differing objectives, strategies, sizes, and homogeneity can impact a collective's efficacy.
  arXiv  Detail & Related papers  (2025-04-30T21:39:06Z)
• Let's Influence Algorithms Together: How Millions of Fans Build Collective Understanding of Algorithms and Organize Coordinated Algorithmic Actions [20.976630706390367]
  This study investigates 43 core fans who always organize large-scale fans collective actions and their corresponding general fan groups.<n>Our findings highlight the key factors that enable computer-supported collective algorithmic actions and extend collective action research into the large-scale domain targeting algorithms.
  arXiv  Detail & Related papers  (2024-09-16T19:11:56Z)
• AgentVerse: Facilitating Multi-Agent Collaboration and Exploring Emergent Behaviors [93.38830440346783]
  We propose a multi-agent framework framework that can collaboratively adjust its composition as a greater-than-the-sum-of-its-parts system. Our experiments demonstrate that framework framework can effectively deploy multi-agent groups that outperform a single agent. In view of these behaviors, we discuss some possible strategies to leverage positive ones and mitigate negative ones for improving the collaborative potential of multi-agent groups.
  arXiv  Detail & Related papers  (2023-08-21T16:47:11Z)
• The Viability of Domain Constrained Coalition Formation for Robotic Collectives [0.0]
  Military and disaster response applications can benefit from robotic collectives' ability to perform multiple cooperative tasks. Coalition formation algorithms can potentially facilitate collective robots' assignment to appropriate task teams. This manuscript identifies the challenges inherent to designing coalition formation algorithms for very large collectives.
  arXiv  Detail & Related papers  (2023-06-08T23:28:41Z)
• Latent Exploration for Reinforcement Learning [87.42776741119653]
  In Reinforcement Learning, agents learn policies by exploring and interacting with the environment. We propose LATent TIme-Correlated Exploration (Lattice), a method to inject temporally-correlated noise into the latent state of the policy network.
  arXiv  Detail & Related papers  (2023-05-31T17:40:43Z)
• This Must Be the Place: Predicting Engagement of Online Communities in a Large-scale Distributed Campaign [70.69387048368849]
  We study the behavior of communities with millions of active members. We develop a hybrid model, combining textual cues, community meta-data, and structural properties. We demonstrate the applicability of our model through Reddit's r/place a large-scale online experiment.
  arXiv  Detail & Related papers  (2022-01-14T08:23:16Z)
• Learning with Group Noise [106.56780716961732]
  We propose a novel Max-Matching method for learning with group noise. The performance on arange of real-world datasets in the area of several learning paradigms demonstrates the effectiveness of Max-Matching.
  arXiv  Detail & Related papers  (2021-03-17T06:57:10Z)
• Learning to Match Jobs with Resumes from Sparse Interaction Data using Multi-View Co-Teaching Network [83.64416937454801]
  Job-resume interaction data is sparse and noisy, which affects the performance of job-resume match algorithms. We propose a novel multi-view co-teaching network from sparse interaction data for job-resume matching. Our model is able to outperform state-of-the-art methods for job-resume matching.
  arXiv  Detail & Related papers  (2020-09-25T03:09:54Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.