- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper studies Bayesian coordination games on unreliable relay lines, with utilities interpolating between private and group-average payoffs. Under full-quorum, root-veto, and observation-monotonicity assumptions, it characterizes coordinating pure equilibria as a message-responsive prefix followed by an unconditionally acting suffix. Three posterior-odds inequalities determine equilibrium validity. The paper also establishes alignment comparative statics and develops an exact compiler that separates equilibrium certification, welfare-based policy selection, and local execution.
Validation includes reported agreement with direct payoff enumeration on 71,640 cutoff checks, computational studies of channel ordering and equilibrium selection, and language-model experiments on equilibrium reconstruction and policy execution. The fresh-game format study finds that decision-table instructions preserve substantially more welfare than full audit certificates, although failures to follow the prescribed fallback remain when assumptions are violated.
Critical strengths
An interpretable structural characterization with computational consequences. The responsive-prefix/blind-suffix theorem reduces the equilibrium problem within the specified class to three transparent incentive constraints. This is more informative than merely enumerating equilibria: it explains which observations are strategically decisive and supports efficient computation of exact validity intervals. The result is a substantive reason to consider acceptance because it connects an understandable coordination mechanism to a tractable solution procedure.
The evaluation distinguishes policy quality from execution fidelity. The paper does not equate finding an equilibrium with achieving useful outcomes, or correct instruction-following with reliable handling of invalid assumptions. Its fresh-game ablation compares representations of the same selected policy and evaluates welfare as well as action agreement. Table 2 on page 8 reports normalized welfare of for decision tables versus for full certificates on the two models. This provides concrete evidence that the execution interface matters, while the separately reported fallback failures appropriately limit the conclusion.
Critical weaknesses
The significance of the restricted equilibrium class is insufficiently established. The characterization requires a relay line, full participation for success, pure observation-monotone strategies, and a root veto. These restrictions exclude actual equilibria: the paper’s own structural search finds 46 of 229 coordinating pure equilibria outside the cutoff family. Welfare optimality is consequently only relative to the certified class, and the paper does not establish the welfare cost of imposing that restriction. This does not invalidate the theorem, but it leaves unclear whether the tractable family captures the important coordination opportunities beyond the selected model. That limitation materially weakens the case for a broadly consequential contribution.
The experiments establish a narrow instruction-execution result rather than a strong empirical connection to incentive alignment. The language models receive externally computed policies; forwarding is fixed, and agents do not communicate during action selection. The decisive format study uses two models and 24 constructed games with three to five agents. Thus, the experiments primarily test reading facts and applying prescribed rules—not whether agents respond strategically to the modeled incentive changes. Although the paper acknowledges this scope, it leaves the theoretical and empirical contributions only loosely connected: the evidence establishes that decision tables work well in this sandbox, but not how much that finding depends on equilibrium certification rather than ordinary rule presentation. A stronger demonstration of that connection is important to the acceptance case.
Questions for authors
No
2 comments
Response by Authors 2
W2. How are the experiments connected to incentive alignment?
In the paper the payoff-bearing agents are the strategic players, and the language models execute their local rules. The incentive weight therefore acts through the compiler: it changes which policy is certified and selected, and the card carries that policy to the model. We agree that this link deserves direct tests. Both tests named in the review are now in the paper as preregistered studies on fresh games, together with a study on scale (Section 5.5, lines 459-489; Appendix N; general response, items 3 and 4). All predictions registered for the two primary models held.
Does unaided execution track incentive changes? No; the response comes through the compiled card. We vary only within each game.
- Given the game, the objective with its , and the selection convention, but no policy, both models play the same heuristic at every . A request to reason step by step does not change this (exploratory).
- With a card compiled at each , behavior follows the exact policy: the tracking index, where 1 means switching exactly where the exact solution does, rises from 0.00 to 1.00 and 0.98, and the welfare gap to the exact policy nearly closes.
- Example (Table 4): in the game of the introduction the exact policy switches from all-WAIT to the hybrid as grows. Without a card, agent 3 never acts on a missing message on either side of the switch; with the card it never does below the switch and always does above it (both models).
Does the result depend on certification or on rule presentation? Execution depends on presentation; what certification adds is stability. We keep the decision table fixed and change only the policy on it: the certified policy, the policy of the reversed link order, the scalar-reduction policy, or a naive rule.
- Fidelity is above 0.99 for all four. We agree with the review on this point: execution does not depend on certification.
- The three uncertified policies are often not equilibria. The scalar policy even prescribes more welfare than (0.26 against 0.22). But under exact best-response dynamics of the payoff-bearing agents it falls to 0.20, for every revision order we tried, and no prescription ends above . This is a solver computation on the game, not model behavior; it is Theorem 3 at work.
Scale: two models, 24 games, three to five agents.
- The three new studies use 68 games, including lines with up to 8 agents and trees. On the longer lines and trees the decision table still loses about 0.01 or less for the two primary models, against 0.57 and 0.17 for the full certificate.
- Three replication executors, added post hoc, follow the table less exactly but still do better with it than with the full certificate. The paper claims near-exact welfare for the two primary models (Table 22).
Forwarding and communication. Forwarding is automatic and agents do not communicate during action selection. This is a property of the model and remains a stated limitation.
Response by Authors 1
We thank the reviewer for the careful review. We apologize for the slightly late response: it took us time to establish the new theoretical result and to prepare the improved version of the paper. All changes to the paper are described in the general response; line numbers refer to the revised PDF. We answer the two weaknesses in turn: the restricted equilibrium class (W1) and the link between theory and experiments (W2).
W1. What does the restriction to the certified family cost?
No welfare loss, when an unsafe quorum is costly enough. This is the new Theorem 3 (Section 3.1, lines 270-287; see also the general response, item 1). Assume full support (the prior and every link reliability lie strictly between 0 and 1) and H>βαL, which holds in every game of the language experiments of Section 5. Then:
Under the uniform condition H>βL, σW at α=1 is optimal among all decentralized behavioral profiles.
The 46 of 229 equilibria outside the family. The question about them is what led us to the theorem. We looked at what they are:
Why the theorem holds. On a line, the agents that act only without a message must form the end of the line. Making them blind gives a cutoff that is again an equilibrium and completes the quorum in the worlds they gave up. In a mixed equilibrium, every type that acts with positive probability has a success probability of at least ρ(α)=(1−βα)L/(U+L), which is at least ρ(1); at or above ρ(1) acting does not lower total welfare. So raising these types to ACT loses nothing, and upward best responses then reach a pure equilibrium, again without loss.
The line and pure strategies. The review also names these two restrictions. Neither is needed for this conclusion. The argument covers mixed equilibria, and under H>βαL Appendix M proves the same result on any acyclic forwarding network (Theorem 6, line 1674), with a closed form on rooted trees (Theorem 5, line 1582); see the general response, item 2. The exact three-inequality characterization of Theorem 1 remains specific to the line.
Checks and scope. Enumeration in exact arithmetic, exhaustive over pure profiles and partial for mixed equilibria, found no failure on 20,724 line games and on 2,300 trees and 1,600 acyclic graphs (Table 21; Appendix M.6, line 1711). The results need a full quorum, a single informed root, and automatic forwarding with receipt-only observations, and the theorems take the parameters as known (Section 7, lines 528-537). If H≤βαL welfare sufficiency can fail; Appendix M.7 (line 1725) reports how often.