SearcharxivSearch

arXiv · 2607.04382

Beyond Self-Resolution: Settlement Factorization for Robust Natural Language Mechanism

Abstract

Language models increasingly mediate paid advice: agents submit open-ended forecasts, recommendations, plans, and evidence; a principal acts on the reports; and the mechanism later pays the contributors. Advice should influence the public decision, but no adviser should write the answer key used to evaluate it. We formalize the separation as settlement factorization: reports are hardened into official records, a public decision record Z may use all advice, and each paid adviser is scored against a label whose production is externalized from their own report, conditional on Z. The central result is an analogue of the revelation principle for this setting: resampling the paid report from a committed ghost distribution inside the settlement channel equips every mechanism with an influence-free reference within a factor of two of the best achievable, so factorization is a normal form, and own-report leakage varepsilon -- measured in total variation -- is an intrinsic invariant of any mechanism, identified behaviorally by worst-case incentive erosion. The invariant has an exact price: with payment kernels of label sensitivity L, truthful margins degrade by at most 2L varepsilon, and the constant is tight -- half own-label manipulation, half pandering to a biased evaluator -- so faithful advice survives outside decision interests D whenever the externalized margin satisfies gamma >D+2L varepsilon. Settling a growing crowd on the shared decision record dilutes every margin exponentially in the informational redundancy, while a factorized leave-one-out label sustains a constant margin at unit stakes. Stakes outbid decision interests but never evaluator capture; randomized reference settlement makes integrity a threshold good priced per unit of total variation; and differential privacy of the evaluator in the paid report certifies varepsilon by construction.

Explore related subjects

Keep this discovery

BibTeXRIS

Nicolas Della Penna. 2026-07-05. Beyond Self-Resolution: Settlement Factorization for Robust Natural Language Mechanism. https://arxiv.org/abs/2607.04382

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

MMS Allocation for Chores with Online Agent Arrivals

We study the fair allocation of $m$ indivisible chores to $n$ agents with subadditive cost functions arriving online in an arbitrary order. Upon an agent's arrival, we are informed of her cost function and must irrevocably assign her a set of chores. We focus on the Maximin Share (MMS) fairness notion and aim to compute an allocation in which all items are assigned, and no agent incurs a cost more than $\alpha$ times her MMS. Without any prior information about the instance (other than $n$ and $m$), we design an algorithm with a competitive ratio of $O(\min\{n, k\log^{1+\epsilon}k, \log m\})$ for any constant $\epsilon > 0$, where $k$ denotes the number of cost function types. Our bound matches the best known offline approximation guarantees for MMS under subadditive costs and is nearly optimal with respect to all three parameters: we show that even for binary additive cost functions, no online algorithm can achieve a competitive ratio of $o(\min\{n, k\log k, \log m\})$. We then consider the setting in which the $k$ cost function types are known in advance (though the realized types of arriving agents are not). For additive cost functions, we provide an algorithm with a competitive ratio of $O(\min\{\log k, \log(kn)/\log\log(kn)\})$, and show that constant-competitive algorithms do not exist for general $k$, even for the binary additive setting. For binary additive functions when $k \le n$, we propose a $3$-competitive algorithm and establish a lower bound of $2$.

cs.GT

Truncated Noisy Best-Response Algorithms: Toward Game Theoretic Learning with Safety Guarantees

We consider a game theoretic approach to solve multi-agent coordination problems with submodular maximization objectives. It is known for such problems that the Nash equilibria for the corresponding game are always within 50% of the optimal, but that the equilibria which achieve this worst-case bound are not stable. To exploit this instability, we propose a family of algorithms which we call Truncated Noisy Best-Response (TNBR) Algorithms. These algorithms are flexibly characterized by agents asynchronously and stochastically selecting actions from a neighbourhood of their best response payoffs. We compute bounds on the recurrent classes of TNBR algorithms' associated Markov chains. Our bounds fall into two categories: first, "Performance" bounds ensure that TNBR algorithms always have a high-value recurrent state; second, "Safety" bounds ensure that TNBR algorithms never have arbitrarily-bad recurrent states. Furthermore, these two types of bounds are linked by a waterbed-like effect: every game with a poor Safety guarantee necessarily has a favorable Performance guarantee.

cs.GT

Existence of the Core in Approval-Based Committee Elections

We settle the main open question in the theory of approval-based multi-winner elections: we show that there always exists a committee in the core. The core is a stability and group fairness concept. The proof introduces a new voting rule that optimizes an entropy-like objective function over committees and payment systems. All local optima of this objective function lie in the core, which implies that a core committee can be found in polynomial time.

cs.GT