When AI Democratizes Exploitation: LLM-Assisted Strategic Manipulation of Fair Division Algorithms

• URL: http://arxiv.org/abs/2511.14722v1
• Date: Tue, 18 Nov 2025 18:09:02 GMT
• Title: When AI Democratizes Exploitation: LLM-Assisted Strategic Manipulation of Fair Division Algorithms
• Authors: Priyanka Verma, Balagopal Unnikrishnan,
• Abstract summary: This paper demonstrates how Large Language Models (LLMs) can dismantle protective barriers by democratizing access to strategic expertise.<n>We show that users can obtain actionable manipulation strategies via simple conversational queries to AI assistants.<n>Our experiments reveal that LLMs can explain algorithmic mechanics, identify profitable deviations, and generate specific numerical inputs for coordinated preference misreporting--capabilities previously requiring deep technical knowledge.
• Score: 1.0365487946214889
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Fair resource division algorithms, like those implemented in Spliddit platform, have traditionally been considered difficult for the end users to manipulate due to its complexities. This paper demonstrates how Large Language Models (LLMs) can dismantle these protective barriers by democratizing access to strategic expertise. Through empirical analysis of rent division scenarios on Spliddit algorithms, we show that users can obtain actionable manipulation strategies via simple conversational queries to AI assistants. We present four distinct manipulation scenarios: exclusionary collusion where majorities exploit minorities, defensive counterstrategies that backfire, benevolent subsidization of specific participants, and cost minimization coalitions. Our experiments reveal that LLMs can explain algorithmic mechanics, identify profitable deviations, and generate specific numerical inputs for coordinated preference misreporting--capabilities previously requiring deep technical knowledge. These findings extend algorithmic collective action theory from classification contexts to resource allocation scenarios, where coordinated preference manipulation replaces feature manipulation. The implications reach beyond rent division to any domain using algorithmic fairness mechanisms for resource division. While AI-enabled manipulation poses risks to system integrity, it also creates opportunities for preferential treatment of equity deserving groups. We argue that effective responses must combine algorithmic robustness, participatory design, and equitable access to AI capabilities, acknowledging that strategic sophistication is no longer a scarce resource.

Related papers

• AI Agents for Inventory Control: Human-LLM-OR Complementarity [12.448705668487852]
  Large language models (LLMs) have generated interest in AI agents that can reason flexibly and incorporate rich contextual signals.<n>We study how OR algorithms, LLMs, and humans can interact and complement each other in a multi-period inventory control setting.<n>We show that, on average, human-AI teams achieve higher profits than either humans or AI agents operating alone.
  arXiv  Detail & Related papers  (2026-02-13T05:23:46Z)
• Collective dynamics of strategic classification [49.14942990735098]
  We apply evolutionary game theory to the problem of feedback loops between collectives of users and institutions.<n>We show that increased detection capabilities reduce social costs and could lead to users' improvement.<n>The speed at which the institutions re-adapt to the user's population plays a role in the final outcome.
  arXiv  Detail & Related papers  (2025-08-12T20:57:17Z)
• Counterfactual Explanations via Locally-guided Sequential Algorithmic Recourse [13.95253855760017]
  We introduce LocalFACE, a model-agnostic technique that composes feasible and actionable counterfactual explanations. Our explainer preserves the privacy of users by only leveraging data that it specifically requires to construct actionable algorithmic recourse.
  arXiv  Detail & Related papers  (2023-09-08T08:47:23Z)
• Strategy Synthesis in Markov Decision Processes Under Limited Sampling Access [3.441021278275805]
  In environments modeled by gray-box Markov decision processes (MDPs), the impact of the agents' actions are known in terms of successor states but not the synthesiss involved. In this paper, we devise a strategy algorithm for gray-box MDPs via reinforcement learning that utilizes interval MDPs as internal model.
  arXiv  Detail & Related papers  (2023-03-22T16:58:44Z)
• Safe Multi-agent Learning via Trapping Regions [89.24858306636816]
  We apply the concept of trapping regions, known from qualitative theory of dynamical systems, to create safety sets in the joint strategy space for decentralized learning. We propose a binary partitioning algorithm for verification that candidate sets form trapping regions in systems with known learning dynamics, and a sampling algorithm for scenarios where learning dynamics are not known.
  arXiv  Detail & Related papers  (2023-02-27T14:47:52Z)
• Human-Centric Multimodal Machine Learning: Recent Advances and Testbed on AI-based Recruitment [66.91538273487379]
  There is a certain consensus about the need to develop AI applications with a Human-Centric approach. Human-Centric Machine Learning needs to be developed based on four main requirements: (i) utility and social good; (ii) privacy and data ownership; (iii) transparency and accountability; and (iv) fairness in AI-driven decision-making processes. We study how current multimodal algorithms based on heterogeneous sources of information are affected by sensitive elements and inner biases in the data.
  arXiv  Detail & Related papers  (2023-02-13T16:44:44Z)
• Inapplicable Actions Learning for Knowledge Transfer in Reinforcement Learning [3.194414753332705]
  We show that learning inapplicable actions greatly improves the sample efficiency of RL algorithms. Thanks to the transferability of the knowledge acquired, it can be reused in other tasks and domains to make the learning process more efficient.
  arXiv  Detail & Related papers  (2022-11-28T17:45:39Z)
• MURAL: Meta-Learning Uncertainty-Aware Rewards for Outcome-Driven Reinforcement Learning [65.52675802289775]
  We show that an uncertainty aware classifier can solve challenging reinforcement learning problems. We propose a novel method for computing the normalized maximum likelihood (NML) distribution. We show that the resulting algorithm has a number of intriguing connections to both count-based exploration methods and prior algorithms for learning reward functions.
  arXiv  Detail & Related papers  (2021-07-15T08:19:57Z)
• A black-box adversarial attack for poisoning clustering [78.19784577498031]
  We propose a black-box adversarial attack for crafting adversarial samples to test the robustness of clustering algorithms. We show that our attacks are transferable even against supervised algorithms such as SVMs, random forests, and neural networks.
  arXiv  Detail & Related papers  (2020-09-09T18:19:31Z)
• Bias in Multimodal AI: Testbed for Fair Automatic Recruitment [73.85525896663371]
  We study how current multimodal algorithms based on heterogeneous sources of information are affected by sensitive elements and inner biases in the data. We train automatic recruitment algorithms using a set of multimodal synthetic profiles consciously scored with gender and racial biases. Our methodology and results show how to generate fairer AI-based tools in general, and in particular fairer automated recruitment systems.
  arXiv  Detail & Related papers  (2020-04-15T15:58:05Z)

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.