Economics of Human and AI Collaboration: When is Partial Automation More Attractive than Full Automation?
- URL: http://arxiv.org/abs/2603.29121v1
- Date: Tue, 31 Mar 2026 01:18:10 GMT
- Title: Economics of Human and AI Collaboration: When is Partial Automation More Attractive than Full Automation?
- Abstract summary: This paper develops a unified framework for evaluating the optimal degree of task automation.<n>We estimate an AI production function via scaling-law experiments linking performance to data, compute, and model size.<n>Full automation is often not cost-minimizing; partial automation, where firms retain human workers for residual tasks, frequently emerges as the equilibrium.
- Score: 7.168698398166703
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper develops a unified framework for evaluating the optimal degree of task automation. Moving beyond binary automate-or-not assessments, we model automation intensity as a continuous choice in which firms minimize costs by selecting an AI accuracy level, from no automation through partial human-AI collaboration to full automation. On the supply side, we estimate an AI production function via scaling-law experiments linking performance to data, compute, and model size. Because AI systems exhibit predictable but diminishing returns to these inputs, the cost of higher accuracy is convex: good performance may be inexpensive, but near-perfect accuracy is disproportionately costly. Full automation is therefore often not cost-minimizing; partial automation, where firms retain human workers for residual tasks, frequently emerges as the equilibrium. On the demand side, we introduce an entropy-based measure of task complexity that maps model accuracy into a labor substitution ratio, quantifying human labor displacement at each accuracy level. We calibrate the framework with O*NET task data, a survey of 3,778 domain experts, and GPT-4o-derived task decompositions, implementing it in computer vision. Task complexity shapes substitution: low-complexity tasks see high substitution, while high-complexity tasks favor limited partial automation. Scale of deployment is a key determinant: AI-as-a-Service and AI agents spread fixed costs across users, sharply expanding economically viable tasks. At the firm level, cost-effective automation captures approximately 11% of computer-vision-exposed labor compensation; under economy-wide deployment, this share rises sharply. Since other AI systems exhibit similar scaling-law economics, our mechanisms extend beyond computer vision, reinforcing that partial automation is often the economically rational long-run outcome, not merely a transitional phase.
Related papers
- $τ_0$-VLA: a Hierarchical Robot Foundation Model with World-Model-Guided Test-Time Computation [51.05516457377339]
Long-horizon robot manipulation requires a robot to both execute individual skills reliably and sequence them coherently over extended tasks.<n>We introduce $_0$-VLA, a hierarchical robot foundation model that formulates high-level subtask generation as a compute-scalable inference problem.<n>A low-level policy then executes the generated subtask across multiple robot embodiments.
arXiv Detail & Related papers (2026-08-17T17:59:11Z) - The Novelty Bottleneck: A Framework for Understanding Human Effort Scaling in AI-Assisted Work [4.726153739634646]
We propose a model of human-AI collaboration that isolates a mechanism we call the novelty bottleneck.<n>The model assumes that tasks decompose into atomic decisions, a fraction $$ of which are "novel"<n>Our contribution is not a proof that human effort must scale linearly, but a framework that identifies the novelty fraction as the key parameter governing AI-assisted productivity.
arXiv Detail & Related papers (2026-03-28T22:50:13Z) - FORMICA: Decision-Focused Learning for Communication-Free Multi-Robot Task Allocation [0.802904964931021]
We introduce a learning-based framework that achieves high-quality task allocation without any robot-to-robot communication.<n>Our method predicts bid distributions to correct systematic errors in analytical mean-field approximations.<n>We train predictors end-to-end to minimize Task Allocation Regret rather than prediction error.
arXiv Detail & Related papers (2026-02-20T21:26:46Z) - EmboCoach-Bench: Benchmarking AI Agents on Developing Embodied Robots [68.29056647487519]
Embodied AI is fueled by high-fidelity simulation and large-scale data collection.<n>However, this scaling capability remains bottlenecked by a reliance on labor-intensive manual oversight.<n>We introduce textscEmboCoach-Bench, a benchmark evaluating the capacity of LLM agents to autonomously engineer embodied policies.
arXiv Detail & Related papers (2026-01-29T11:33:49Z) - Remote Labor Index: Measuring AI Automation of Remote Work [46.53553410123801]
AIs have made rapid progress on research-oriented benchmarks of knowledge and reasoning, but it remains unclear how these gains translate into economic value and automation.<n>To measure this, we introduce the Remote Labor Index (RLI), a broadly multi-sector benchmark comprising real-world, economically valuable projects.
arXiv Detail & Related papers (2025-10-30T17:58:04Z) - Idempotent Equilibrium Analysis of Hybrid Workflow Allocation: A Mathematical Schema for Future Work [0.0]
Large-scale AI systems are reshaping how work is divided between people and machines.<n>We formalise this reallocation as an iterated task-delegation map and show that the process converges to a stable idempotent equilibrium.<n>We argue that policies which promote "centaur" human-AI teaming can steer the economy toward the welfare-maximising fixed point.
arXiv Detail & Related papers (2025-08-02T11:28:34Z) - E2E Process Automation Leveraging Generative AI and IDP-Based Automation Agent: A Case Study on Corporate Expense Processing [1.5728609542259502]
This paper presents an intelligent work automation approach in the context of contemporary digital transformation.<n>It integrates generative AI and Intelligent Document Processing technologies with an Automation Agent to realize End-to-End (E2E) automation of corporate financial expense processing tasks.
arXiv Detail & Related papers (2025-05-27T05:21:08Z) - Adaptation of XAI to Auto-tuning for Numerical Libraries [0.0]
Explainable AI (XAI) technology is gaining prominence, aiming to streamline AI model development and alleviate the burden of explaining AI outputs to users.
This research focuses on XAI for AI models when integrated into two different processes for practical numerical computations.
arXiv Detail & Related papers (2024-05-12T09:00:56Z) - The Foundations of Computational Management: A Systematic Approach to
Task Automation for the Integration of Artificial Intelligence into Existing
Workflows [55.2480439325792]
This article introduces Computational Management, a systematic approach to task automation.
The article offers three easy step-by-step procedures to begin the process of implementing AI within a workflow.
arXiv Detail & Related papers (2024-02-07T01:45:14Z) - Intelligent Trajectory Design for RIS-NOMA aided Multi-robot
Communications [59.34642007625687]
The goal is to maximize the sum-rate of whole trajectories for multi-robot system by jointly optimizing trajectories and NOMA decoding orders of robots.
An integrated machine learning (ML) scheme is proposed, which combines long short-term memory (LSTM)-autoregressive integrated moving average (ARIMA) model and dueling double deep Q-network (D$3$QN) algorithm.
arXiv Detail & Related papers (2022-05-03T17:14:47Z) - Induction and Exploitation of Subgoal Automata for Reinforcement
Learning [75.55324974788475]
We present ISA, an approach for learning and exploiting subgoals in episodic reinforcement learning (RL) tasks.
ISA interleaves reinforcement learning with the induction of a subgoal automaton, an automaton whose edges are labeled by the task's subgoals.
A subgoal automaton also consists of two special states: a state indicating the successful completion of the task, and a state indicating that the task has finished without succeeding.
arXiv Detail & Related papers (2020-09-08T16:42:55Z)
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.