What does this equation mean?

Debate targets the oversight ceiling directly rather than working around it, and its motivation is stated in explicitly theoretical terms. Irving, Christiano, and Amodei propose training two agents through self-play in a zero-sum game: each argues a position in alternating statements, and a human judge decides which one gave more true, useful information. The paper’s central theoretical claim draws an analogy to computational complexity theory, arguing that if optimal play in the debate game tracks truth, then a judge with only polynomial-time reasoning ability could in principle adjudicate a debate about problems in the complexity class PSPACE — that is, questions considerably harder than the judge could solve alone [ 8 ] . Formally, debate is a minimax game over a judge’s payoff: $\max_{\pi_1}\;\min_{\pi_2}\;\; \mathbb{E}_{\tau\sim(\pi_1,\pi_2)}\big[\mathrm{Judge}(\tau)\big]$. where the honest debater’s strategy is the one that performs best against a worst-case opponent, and the entire theoretical case for the method rests on the claim that truth has a structural advantage in such a game: that it is easier to defend a true position convincingly than to defend a false one, so honesty is the equilibrium strategy even when the judge cannot verify the underlying facts directly. The paper’s own initial empirical test was modest by design — an MNIST-digit-classification game in which debating agents revealed pixels to a judge who could see only a handful of them, raising classification accuracy from 59.4 to 88.9 percent with six revealed pixels — offered as a proof of concept for the mechanism rather than evidence about language-model debate [ 8 ] .