atlas

Research map / Multi-agent systems and games / Human-AI and goal-conditioned

A No Free Lunch Theorem for Human-AI Collaboration

AAAI 2025 · Multi-agent systems and games › Human-AI and goal-conditioned · approach: Human-AI coordination agents · 4 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Theoretical no-free-lunch result showing that any deterministic collaboration strategy combining calibrated probabilistic predictions that never performs worse than the least accurate agent must essentially always defer to one fixed agent.

Problem

When can combining calibrated probabilistic predictions from multiple agents (e.g., humans and algorithms) in binary classification guarantee complementarity, i.e., accuracy at least as good as the least accurate agent and sometimes better than all agents?

Approach

Proves that reliable (never worse than the worst agent) deterministic collaboration strategies over calibrated predictors must be non-collaborative, deferring to a single fixed agent except when another agent is fully certain (predicts exactly 0 or 1); the proof builds adversarial collaboration settings via partitions and mixes them linearly.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use a deterministic collaboration strategy that does not always defer to one fixed agentCollaboration among calibrated agents · Binary classification0-1 accuracyHurt
Defer to a fixed agent except when another agent is fully certainCollaboration among calibrated agents · Binary classification0-1 accuracyHelped
Defer to an agent who is very confident but not certainCollaboration among calibrated agents · Binary classification0-1 accuracyNo clear effect
Use independence between agents’ predictionsPrediction aggregation · Binary classification0-1 accuracyHelped
Learn the joint behavior of agents to decide when and how much to trust themPrediction aggregation · Binary classification0-1 accuracyHelped

Surprising findings

Limitations

Experimental setup

Metrics: 0-1 accuracy

Builds on: Wolpert and Macready No Free Lunch theorem Arrow's Impossibility Theorem Condorcet's Jury Theorem

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy