A Statistical Framework for Algorithmic Collective Action with Multiple Collectives

• URL: http://arxiv.org/abs/2605.06749v1
• Date: Thu, 07 May 2026 15:45:53 GMT
• Title: A Statistical Framework for Algorithmic Collective Action with Multiple Collectives
• Abstract summary: We propose the first comprehensive statistical framework for Algorithmic Collective Action (ACA) with multiple collectives acting on the same system.<n>We provide quantitative statistical bounds on the success of the collectives, considering the role and the interplay of the collectives' sizes and the alignment of their goals.<n>We numerically illustrate our framework on simulations inspired by interventions for climate adaptation in smart cities.
• Score: 10.953000365787508
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As learning systems increasingly shape everyday decisions, Algorithmic Collective Action (ACA), i.e., users coordinating changes to shared data to steer model behavior, offers a complement to regulator-side policy and corporate model design. Real-world collective actions have traditionally been decentralized and fragmented into multiple collectives, despite sharing overarching objectives, with each collective differing in size, strategy, and actionable goals. However, most of the ACA literature focuses on single collective settings. To address this, we propose the first comprehensive statistical framework for ACA with multiple collectives acting on the same system. In particular, we focus on collective action in classification, studying how multiple collectives can influence a classifier's behavior. We provide quantitative statistical bounds on the success of the collectives, considering the role and the interplay of the collectives' sizes and the alignment of their goals. We make such bounds computable by each collective with only partial knowledge of other collectives' sizes and strategies. Finally, we numerically illustrate our framework on simulations inspired by interventions for climate adaptation in smart cities, demonstrating the usefulness of our bounds.

Related papers

• TeamHOI: Learning a Unified Policy for Cooperative Human-Object Interactions with Any Team Size [54.0714652192002]
  Physics-based humanoid control has achieved remarkable progress in enabling realistic and high-performing single-agent behaviors.<n>We present TeamHOI, a framework that enables a single decentralized policy to handle cooperative HOIs across any number of cooperating agents.
  arXiv  Detail & Related papers  (2026-03-09T05:52:13Z)
• Decentralized Dynamic Cooperation of Personalized Models for Federated Continual Learning [50.56947843548702]
  We propose a decentralized dynamic cooperation framework for Federated continual learning.<n>Clients establish dynamic cooperative learning coalitions to balance the acquisition of new knowledge and the retention of prior learning.<n>We also propose a merge-blocking algorithm and a dynamic cooperative evolution algorithm to achieve cooperative and dynamic equilibrium.
  arXiv  Detail & Related papers  (2025-09-28T06:53:23Z)
• 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)
• 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)
• Multi Activity Sequence Alignment via Implicit Clustering [50.3168866743067]
  We propose a novel framework that overcomes limitations using sequence alignment via implicit clustering.<n>Specifically, our key idea is to perform implicit clip-level clustering while aligning frames in sequences.<n>Our experiments show that our proposed method outperforms state-of-the-art results.
  arXiv  Detail & Related papers  (2025-03-16T14:28:46Z)
• Achieving Collective Welfare in Multi-Agent Reinforcement Learning via Suggestion Sharing [12.167248367980449]
  Conflict between self-interest and collective well-being often obstructs efforts to achieve shared welfare.<n>We propose a novel multi-agent reinforcement learning (MARL) method to address this issue.<n>Unlike traditional cooperative MARL solutions that involve sharing rewards, values, and policies, we propose a novel MARL approach where agents exchange action suggestions.
  arXiv  Detail & Related papers  (2024-12-16T19:44:44Z)
• Causal Coordinated Concurrent Reinforcement Learning [8.654978787096807]
  We propose a novel algorithmic framework for data sharing and coordinated exploration for the purpose of learning more data-efficient and better performing policies under a concurrent reinforcement learning setting. Our algorithm leverages a causal inference algorithm in the form of Additive Noise Model - Mixture Model (ANM-MM) in extracting model parameters governing individual differentials via independence enforcement. We propose a new data sharing scheme based on a similarity measure of the extracted model parameters and demonstrate superior learning speeds on a set of autoregressive, pendulum and cart-pole swing-up tasks.
  arXiv  Detail & Related papers  (2024-01-31T17:20:28Z)
• Universal Semi-supervised Model Adaptation via Collaborative Consistency Training [92.52892510093037]
  We introduce a realistic and challenging domain adaptation problem called Universal Semi-supervised Model Adaptation (USMA) We propose a collaborative consistency training framework that regularizes the prediction consistency between two models. Experimental results demonstrate the effectiveness of our method on several benchmark datasets.
  arXiv  Detail & Related papers  (2023-07-07T08:19:40Z)
• An attention model for the formation of collectives in real-world domains [78.1526027174326]
  We consider the problem of forming collectives of agents for real-world applications aligned with Sustainable Development Goals. We propose a general approach for the formation of collectives based on a novel combination of an attention model and an integer linear program.
  arXiv  Detail & Related papers  (2022-04-30T09:15:36Z)
• You Never Cluster Alone [150.94921340034688]
  We extend the mainstream contrastive learning paradigm to a cluster-level scheme, where all the data subjected to the same cluster contribute to a unified representation. We define a set of categorical variables as clustering assignment confidence, which links the instance-level learning track with the cluster-level one. By reparametrizing the assignment variables, TCC is trained end-to-end, requiring no alternating steps.
  arXiv  Detail & Related papers  (2021-06-03T14:59:59Z)

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.