Tackling the Algorithmic Control Crisis -- the Technical, Legal, and Ethical Challenges of Research into Algorithmic Agents

• URL: http://arxiv.org/abs/2510.25337v1
• Date: Wed, 29 Oct 2025 09:52:02 GMT
• Title: Tackling the Algorithmic Control Crisis -- the Technical, Legal, and Ethical Challenges of Research into Algorithmic Agents
• Authors: B. Bodo, N. Helberger, K. Irion, F. Zuiderveen Borgesius, J. Moller, B. Van der Velde, N. Bol, B. van Es, C. de Vreese,
• Abstract summary: This paper aims to describe one possible approach to researching the individual and societal effects of algorithmic recommenders.<n>Our paper will contribute to the discussion on the relative merits, costs and benefits of different approaches to ethically and legally sound research on algorithmic governance.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Algorithmic agents permeate every instant of our online existence. Based on our digital profiles built from the massive surveillance of our digital existence, algorithmic agents rank search results, filter our emails, hide and show news items on social networks feeds, try to guess what products we might buy next for ourselves and for others, what movies we want to watch, and when we might be pregnant. Algorithmic agents select, filter, and recommend products, information, and people. Increasingly, algorithmic agents don't just select from the range of human created alternatives, but also they create. Burgeoning algorithmic agents are capable of providing us with content made just for us, and engage with us through one-of-a-kind, personalized interactions. Studying these algorithmic agents presents a host of methodological, ethical, and logistical challenges. The objectives of our paper are two-fold. The first aim is to describe one possible approach to researching the individual and societal effects of algorithmic recommenders, and to share our experiences with the academic community. The second is to contribute to a more fundamental discussion about the ethical and legal issues of "tracking the trackers", as well as the costs and trade-offs involved. Our paper will contribute to the discussion on the relative merits, costs and benefits of different approaches to ethically and legally sound research on algorithmic governance. We will argue that besides shedding light on how users interact with algorithmic agents, we also need to be able to understand how different methods of monitoring our algorithmically controlled digital environments compare to each other in terms of costs and benefits. We conclude our article with a number of concrete suggestions for how to address the practical, ethical and legal challenges of researching algorithms and their effects on users and society.

Related papers

• Algorithmic Collusion of Pricing and Advertising on E-commerce Platforms [0.0]
  Online sellers have been adopting AI learning algorithms to automatically make product pricing and advertising decisions on e-commerce platforms.<n>One concern is that of collusion - the algorithms learn to coordinate on higher than competitive.<n>We empirically investigate whether these concerns are valid when sellers make pricing and advertising decisions together.
  arXiv  Detail & Related papers  (2025-08-09T18:44:17Z)
• Contractual Reinforcement Learning: Pulling Arms with Invisible Hands [68.77645200579181]
  We propose a theoretical framework for aligning economic interests of different stakeholders in the online learning problems through contract design. For the planning problem, we design an efficient dynamic programming algorithm to determine the optimal contracts against the far-sighted agent. For the learning problem, we introduce a generic design of no-regret learning algorithms to untangle the challenges from robust design of contracts to the balance of exploration and exploitation.
  arXiv  Detail & Related papers  (2024-07-01T16:53:00Z)
• Approaches to the Algorithmic Allocation of Public Resources: A Cross-disciplinary Review [0.0]
  We performed a cross disciplinary literature review to understand approaches taken for different areas of algorithmic allocation. We analyzed the 75 papers from the lenses of optimization goals, techniques, interpretability, flexibility, bias, ethical considerations, and performance. We found considerable potential for performance gains, with optimization techniques often decreasing waiting times and increasing success rate by as much as 50%.
  arXiv  Detail & Related papers  (2023-10-10T09:46:01Z)
• A Gold Standard Dataset for the Reviewer Assignment Problem [70.45113777449373]
  "Similarity score" is a numerical estimate of the expertise of a reviewer in reviewing a paper.<n>Key challenge in comparing existing algorithms and developing better algorithms is the lack of publicly available gold-standard data.<n>We collect a novel dataset of similarity scores that we release to the research community.
  arXiv  Detail & Related papers  (2023-03-23T16:15:03Z)
• A Dataset on Malicious Paper Bidding in Peer Review [84.68308372858755]
  Malicious reviewers strategically bid in order to unethically manipulate the paper assignment. A critical impediment towards creating and evaluating methods to mitigate this issue is the lack of publicly-available data on malicious paper bidding. We release a novel dataset, collected from a mock conference activity where participants were instructed to bid either honestly or maliciously.
  arXiv  Detail & Related papers  (2022-06-24T20:23:33Z)
• How to transfer algorithmic reasoning knowledge to learn new algorithms? [23.335939830754747]
  We investigate how we can use algorithms for which we have access to the execution trace to learn to solve similar tasks for which we do not. We create a dataset including 9 algorithms and 3 different graph types. We validate this empirically and show how instead multi-task learning can be used to achieve the transfer of algorithmic reasoning knowledge.
  arXiv  Detail & Related papers  (2021-10-26T22:14:47Z)
• Beyond Algorithmic Bias: A Socio-Computational Interrogation of the Google Search by Image Algorithm [0.799536002595393]
  We audit the algorithm by presenting it with more than 40 thousands faces of all ages and more than four races. We find that the algorithm reproduces white male patriarchal structures, often simplifying, stereotyping and discriminating females and non-white individuals.
  arXiv  Detail & Related papers  (2021-05-26T21:40:43Z)
• Exploration and Incentives in Reinforcement Learning [107.42240386544633]
  We consider complex exploration problems, where each agent faces the same (but unknown) MDP. Agents control the choice of policies, whereas an algorithm can only issue recommendations. We design an algorithm which explores all reachable states in the MDP.
  arXiv  Detail & Related papers  (2021-02-28T00:15:53Z)
• Problematic Machine Behavior: A Systematic Literature Review of Algorithm Audits [0.0]
  This review follows PRISMA guidelines in a review of over 500 English articles that yielded 62 algorithm audit studies. The studies are synthesized and organized primarily by behavior (discrimination, distortion, exploitation, and misjudgement) The paper concludes by offering the common ingredients of successful audits, and discussing algorithm auditing in the context of broader research.
  arXiv  Detail & Related papers  (2021-02-03T19:21:11Z)
• 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)
• Algorithms for Fair Team Formation in Online Labour Marketplaces [6.446179861303341]
  We aim to guarantee that the process of hiring workers through the use of machine learning and algorithmic data analysis tools does not discriminate, even unintentionally, on grounds of nationality or gender. We provide inapproximability results for the Fair Team Formation problem together with four algorithms for the problem itself. We also tested the effectiveness of our algorithmic solutions by performing experiments using real data from an online labor marketplace.
  arXiv  Detail & Related papers  (2020-02-14T11:33:35Z)
• Adversarial Attacks on Linear Contextual Bandits [87.08004581867537]
  Malicious agents may have incentives to attack the bandit algorithm to induce it to perform a desired behavior. We show that a malicious agent can force a linear contextual bandit algorithm to pull any desired arm $T - o(T)$ times over a horizon of $T$ steps. We also investigate the case when a malicious agent is interested in affecting the behavior of the bandit algorithm in a single context.
  arXiv  Detail & Related papers  (2020-02-10T15:04:09Z)

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.