{"id":"200c357e-c5fd-48a2-b6f3-f8186c34bf36","arxiv_id":"2607.10064","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.5,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"MNW is uniquely characterized by EF1 + strategyproofness + neutrality + minimal completeness + IDU for any number of agents (and by a non-redundancy + resource-monotonicity variant for two agents); all axioms are independent.","lead":"Under binary (yes/no) valuations for indivisible goods, the maximum Nash welfare rule is the unique rule satisfying EF1, strategyproofness, neutrality, minimal completeness and a new invariance axiom (IDU). This pins down MNW (and its equivalents leximin and strictly concave welfarists) as the canonical choice in the binary domain, with a second characterization for two agents.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The Reader correctly isolates IDU as the novel axiom that makes the n-agent result possible, yet also correctly notes that the two-agent alternative characterization (Theorem 4.2) and the necessity propositions already address that caveat. Because the mathematics is elementary, self-contained, and free of computational or empirical claims, the only remaining verification step is careful reading of the proofs. That reading reveals no load-bearing flaw: every reduction is justified by an axiom that is later shown to be necessary, and the critical-path characterization of MNW is taken from prior work. Consequently the Reader’s ACCEPT verdict with high confidence stands.","tokens_in":25195,"tokens_out":407,"duration_ms":3672,"concrete_test":"Independently re-derive the base case k=2 of Theorem 3.2 (the induction that |A^α_2| remains constant while agent 2 approves successive goods from A_1) without invoking IDU after the initial pruning step; if the same contradiction with EF1 is obtained, the load-bearing role of IDU is confined to the reduction and does not affect the uniqueness core.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central uniqueness claims (Theorems 3.2 and 4.2) rest on elementary case analysis of critical paths (Lemma 3.1) together with the five/six listed axioms. The proofs are fully written out, the reductions via IDU (or non-redundancy + resource-monotonicity) are explicit, and independence is demonstrated by concrete counter-examples (Propositions 3.4 and 4.5). The only non-standard ingredient is the newly introduced IDU axiom, but the paper itself supplies an independent two-agent characterization that avoids it, and the necessity results show that each axiom is required. No hidden assumption, gap, or internal inconsistency is apparent.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper studies fair division of indivisible goods under binary additive valuations, where MNW, leximin, and strictly concave additive welfarist rules coincide. It proves that, for any fixed n≥2, this common rule is the unique allocation rule satisfying EF1, strategyproofness, neutrality, minimal completeness, and the new axiom IDU (invariance under disapproving unassigned goods). For n=2 an alternative characterization replaces IDU by non-redundancy plus resource-monotonicity. Both uniqueness results are tight: each axiom is shown necessary by explicit counter-examples (Propositions 3.4 and 4.5). Additional theorems refine the consistent tie-breaking behaviour that any such rule must exhibit on instances with the same number of (valued) goods.","tokens_in":25386,"tokens_out":742,"duration_ms":21689,"significance":"These appear to be the first characterizations of MNW among the class of all (not merely welfarist) allocation rules in any valuation domain. Because MNW is already known to be strategyproof, resource-monotone and polynomial-time computable under binary valuations, the axiomatic uniqueness results supply strong normative justification for its use in this domain. The proofs are fully written, rest on the critical-path characterization of MNW (Halpern et al., 2020), employ careful shortest-path and inductive arguments, and include complete independence examples. The two-agent alternative characterization further shows that the newly introduced IDU axiom is not indispensable for the n=2 case.","major_comments":[],"minor_comments":[{"comment":"Section 2 (Definitions 2.3–2.4 and Lemma 2.8): the logical relationships among PO, non-redundancy and minimal completeness are stated clearly, but a short remark that any two of them imply the third would help readers who skip the lemma.","section":null},{"comment":"Definition 2.7 (IDU) and the surrounding paragraph: the analogy to IIA / non-bossiness is helpful; a one-sentence example of a natural rule (e.g., a consistent picking sequence) that satisfies IDU would make the axiom more immediately intuitive.","section":null},{"comment":"Proof of Theorem 3.2, Case 1: the reductions that prune valuations via IDU while preserving the critical path are correct, yet the notation for the successive profiles P, P', P'', P''' becomes dense; a short table or diagram summarizing the successive changes would improve readability.","section":null},{"comment":"Throughout the manuscript (especially Appendices A–B): several author names contain residual LaTeX accent artefacts (e.g., \"Lemaˆ ıtre\", \"Herv´ e\"); these should be cleaned for the camera-ready version.","section":null},{"comment":"Section 5: the open question of extending the resource-monotonicity characterization beyond n=2 is well-posed; a brief remark on the combinatorial obstacle (the 2^n-1 numbers needed to describe a profile) already present in the text could be moved into the main body for emphasis.","section":null}],"recommendation":"accept","confidential_remarks":"The paper is a clean, self-contained contribution that fits well in a theory journal (Social Choice and Welfare, TEAC, or a top AI/econ venue). No concerns about novelty disclosure or citation patterns."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"This paper gives the first characterizations of MNW (equivalently leximin / strictly concave additive welfarism) among all allocation rules, not just the welfarist subclass, for binary valuations. That is the real advance over Suksompong 2023 and Yuen-Suksompong 2023.\n\nTheorem 3.2 is the main result: for any n ≥ 2, EF1 + strategyproofness + neutrality + minimal completeness + IDU force the rule to maximize Nash welfare. The proof is elementary case analysis on shortest critical paths (via Halpern et al.’s Lemma 3.1), with careful reductions that prune valuations while preserving the allocation. Theorem 4.2 supplies a clean two-agent alternative that swaps IDU for non-redundancy + resource-monotonicity; the induction on the number of goods is transparent. Both characterizations come with tight independence examples (Props 3.4 and 4.5) and sensible tie-breaking refinements. The math is fully written, self-contained, and free of free parameters or circular definitions.\n\nThe only soft spot is that IDU is new and load-bearing for n > 2. The authors motivate it reasonably (independence-of-irrelevant-alternatives flavor, satisfied by welfarist rules and picking sequences), and they immediately give the two-agent escape hatch, so the paper does not collapse if one dislikes IDU. Resource-monotonicity is known to fail outside binary valuations, but that is outside the paper’s scope. Citation pattern is appropriate; the coincidence of MNW/leximin/concave welfarism is correctly attributed.\n\nThis is for people who care about axiomatic fair division of indivisibles. It solidifies the case for MNW in the binary domain where the rule is already strategyproof, resource-monotone, and poly-time. I would bring it to reading group and would cite the uniqueness statements. A serious editor should send it to referees; the proofs are there to check and the contribution is clear.","headline":"First full-space uniqueness theorems for MNW under binary valuations; clean proofs, necessary axioms, and a usable two-agent alternative that avoids the new IDU axiom.","tokens_in":25948,"tokens_out":512,"would_cite":true,"duration_ms":4768,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["91B32","91B14"],"pacs":[],"model":"grok-4.5","headline":"Under binary valuations, EF1, strategyproofness, neutrality, minimal completeness and IDU uniquely force the maximum-Nash-welfare rule for any number of agents.","keywords":["fair division","binary valuations","maximum Nash welfare","EF1","strategyproofness","resource-monotonicity","axiomatic characterization"],"falsifier":"Exhibit any allocation rule, other than an MNW rule, that is EF1, strategyproof, neutral, minimally complete and IDU on binary instances with three or more agents; or show that the five axioms force only a proper subclass of MNW allocations once n>2.","tokens_in":26115,"feed_emoji":"⚖️","tokens_out":561,"duration_ms":4858,"temperature":0.7,"pith_summary":"When goods are indivisible and every agent simply approves or disapproves each good, three classic welfare rules become identical: maximum Nash welfare, leximin, and every additive strictly-concave welfarist rule. The paper proves that this single rule is the only allocation rule that simultaneously satisfies envy-freeness up to one good, strategyproofness, neutrality, minimal completeness and a new invariance property called IDU. For two agents the same uniqueness holds after IDU is replaced by non-redundancy and resource-monotonicity. Both characterizations are tight: drop any listed axiom and a non-MNW rule appears that still satisfies the rest. The result therefore supplies the first axiomatic foundation that singles out this common rule among all conceivable allocation procedures in the binary domain.","feed_headline":"Binary approvals force maximum Nash welfare uniquely","feed_subtitle":"Five axioms, including a new invariance property, leave no other rule for any number of agents.","key_machinery":"Critical-path characterization of MNW (Lemma 3.1): an allocation maximises Nash welfare if and only if it is Pareto optimal and contains no critical path of agents along which one agent’s bundle is larger by more than one than a later agent’s bundle; the uniqueness proofs reduce every counter-example to a shortest critical path and then use the remaining axioms to produce a shorter one.","core_discovery":"Any rule that is EF1, strategyproof, neutral, minimally complete and IDU must return a maximum-Nash-welfare allocation for every binary-valuation instance with any number of agents; for two agents the same conclusion holds when IDU is replaced by non-redundancy plus resource-monotonicity, and every listed axiom is indispensable.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Binary valuations pin max Nash welfare as sole EF1 strategyproof rule","EF1 plus strategyproofness and IDU force max Nash welfare for any agents","Only max Nash welfare survives five axioms under binary valuations","Two-agent swap: non-redundancy and monotonicity still force max Nash welfare","All listed axioms indispensable in max Nash welfare characterizations"],"cache_read_input_tokens":16512,"weakest_assumption_plain":"The new invariance axiom IDU—that an agent’s decision to stop approving an unassigned good never changes the chosen allocation—is indispensable for the multi-agent uniqueness claim.","fun_headline_variants_meta":{"raw":{"variants":["Binary valuations pin max Nash welfare as sole EF1 strategyproof rule","EF1 plus strategyproofness and IDU force max Nash welfare for any agents","Only max Nash welfare survives five axioms under binary valuations","Two-agent swap: non-redundancy and monotonicity still force max Nash welfare","All listed axioms indispensable in max Nash welfare characterizations"]},"model":"grok-4.5","effort":"low","cost_usd":0.003596,"raw_usage":{"total_tokens":1086,"prompt_tokens":634,"num_sources_used":0,"completion_tokens":94,"cost_in_usd_ticks":35960000,"prompt_tokens_details":{"text_tokens":634,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":358,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":634,"tokens_out":94,"duration_ms":3379,"temperature":1.0,"reasoning_tokens":358,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-14T00:39:30.914038+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Exhibit any allocation rule, other than an MNW rule, that is EF1, strategyproof, neutral, minimally complete and IDU on binary instances with three or more agents; or show that the five axioms force only a proper subclass of MNW allocations once n>2.","supporting_citations":[],"review_version":1}