Playing log(N)-Questions over Wikipedia Abstracts: Communication Efficiency Between Paired Frontier Models

Paper recorded by Signals 4 on 2026-09-16 in cs.CL. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-16 on arXiv · recorded by Signals 4 on 2026-09-17

Category: cs.CL · 自然语言处理 · first seen 2026-09-17

Abstract

We evaluate six frontier language models on the two-agent $\log(N)$-Questions game. A questioner sees $N$ Wikipedia lead paragraphs and must identify a secretly chosen target using exactly $\log_2 N$ yes/no questions. An answerer sees only the target and the question, and replies with one word. Both roles run on the same provider, so the game measures how well a model communicates with itself acro

Read on arXiv →