{"id":"fc6b78a0-7add-474b-a19d-13382c502cb5","arxiv_id":"2506.18794","paper_version":1,"verdict":"CONDITIONAL","confidence":"HIGH","novelty_score":5.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper proves implication and tightness relations among four money-related objectives in weighted envy-free allocation with indivisible items.","lead":"This short paper compares four ways of measuring the money needed to make an item allocation envy-free, and shows which upper bounds imply which. It matters because minimizing money is not a single objective, and the choice changes what a fair division mechanism can promise.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 4.5's tightness claim for the n/4 factor fails when n is odd: the construction uses n/2 items, and equality in the affine-combination bound requires an even split of agents, so the true worst-case negative-payment sum for odd n is floor(n^2/4)T/n, not nT/4.","rationale":"I read the paper as a formal comparison of four subsidy/payment objectives in a quasilinear, unbounded-transfer model. The core transformations in Lemmas 4.1-4.4 are correct; the equivalence between P2 and P3 and the P1-to-P2/P3 implications are not in doubt. The reader's weakest assumption about unbounded payments is a real modeling limitation, but it is explicitly part of the paper's setup (payments are defined with no budget constraint, and loans are mentioned in the motivation), so I do not treat it as a load-bearing correctness flaw. The most concrete internal flaw is the claimed tightness of the T n/4 factor in Lemma 4.5. The proof's affine-combination argument can only be tight when the number of negative-payment agents equals the number of positive-payment agents, which forces n even; and the illustrative example literally uses n/2 items. For odd n, the optimization over k yields floor(n^2/4)T/n, strictly less than nT/4. This is a minor but real technical error in a claim highlighted in the reader's strongest claim. The fix is straightforward (add an even-n assumption or replace n/4 by floor(n^2/4)/n), and the upper bound is untouched, so the conditional verdict remains appropriate. I therefore leave the reader's verdict unchanged.","tokens_in":4557,"tokens_out":20610,"duration_ms":218062,"concrete_test":"Recompute the worst-case total negative payment in Lemma 4.5 with k constrained to be an integer and n=3, T=1. Enumerate the extreme subsidy vectors (each s_i in {0,1}) that can arise from a WEF allocation with one item given to one agent, compute the balanced shift p_i = s_i - (sum s)/3, and record the sum of negative payments. If the maximum is 2/3 rather than 3/4, the claimed tight factor nT/4 is false for odd n.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central comparison of objectives is otherwise sound, but the sharpness claim for Lemma 4.5 (Section 4.4) is not correct as stated for all n. The tightness example begins 'Suppose there are n/2 items of value T', which is undefined for odd n. More importantly, equality in the affine-combination proof requires both upper bounds on the total negative payment S to be tight simultaneously: S = kx and S = (n-k)(T-x), with x = T/2. These equations force k = n-k, i.e., n even. For odd n, maximizing over integer k in S <= kx and S <= (n-k)(T-x) gives max floor(n^2/4) * T/n, which is strictly below nT/4 (for n=3 it is 2T/3). Thus the upper bound nT/4 remains valid, but the assertion 'The factor T n/4 is tight' is false for odd n unless an even-n qualifier or a floor correction is added. This directly affects the paper's claimed tightness in the P1-to-P4 implication, although it does not invalidate the bound itself.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper compares four optimization objectives for restoring weighted envy-freeness with monetary transfers: bounding the maximum subsidy per agent (P1), the total subsidy (P2), the largest negative balanced payment (P3), and the sum of negative balanced payments (P4). It proves formal implications among the corresponding upper-bound problems: a P1 bound implies a P2 bound with factor n-1 (or W-w_1 in the weighted case), P2 and P3 are equivalent up to a factor of W, a P1 bound implies a P3 bound, and for equal entitlements a P1 bound implies a P4 bound of Tn/4. The paper also gives examples showing that the reverse implications fail, and it leaves the relation between (P2)=(P3) and (P4), as well as weighted P4, as open problems.","tokens_in":4823,"tokens_out":7453,"duration_ms":75695,"significance":"If the claims are taken with the corrections below, this note provides a clean and useful map between several natural objectives in fair allocation with money. The proofs are elementary but the comparisons are not all obvious, and the explicit tightness examples, despite the parity issue in Lemma 4.5, help clarify the logical relations between subsidy-based and payment-based fairness formulations. The paper is self-contained after the placeholder related-work section is set aside, and its main conceptual message—that P1 is strictly stronger than P2, P3, and P4, while P2 and P3 are equivalent—is a useful contribution for researchers choosing which bound to prove. The mathematical claims are mostly verified; the main defects are a missing even-n qualifier in the tightness claim of Lemma 4.5 and an ambiguity about the ordering of weights in Lemma 4.2(b).","major_comments":[{"comment":"The upper-bound proof of Tn/4 is correct, but the statement 'The factor Tn/4 is tight' is false for odd n. The tightness construction uses n/2 items, which is undefined when n is odd, and equality in the affine-combination argument requires k=n-k, i.e., n even. For odd n, the maximum of min(kx, (n-k)(T-x)) over integer k and real x is floor(n^2/4) T/n, which is strictly smaller than nT/4 (for n=3 it is 2T/3). The claim should be restricted to even n or replaced by the corrected floor(n^2/4)T/n bound.","section":"Section 4.4, Lemma 4.5"},{"comment":"The statement of Lemma 4.2(b) uses w_1 without explicitly defining it as the smallest entitlement. The proof then refers to 'the agent with the smallest entitlement (w_1)' and uses W-w_1 as the sum of the n-1 largest weights. As written, if w_1 is not the minimum weight, the factor (W-w_1)T is not tight and the proof does not match the statement. Please add the ordering assumption w_1 <= w_2 <= ... <= w_n to the lemma.","section":"Section 4, Lemma 4.2(b)"},{"comment":"The model defines a payment vector p without any feasibility or budget constraint. The transformations in Lemmas 4.1(b), 4.3, and 4.5 set p_i = s_i - z w_i, which can be arbitrarily negative and may exceed an agent's available resources; the claimed equivalences therefore hold only in an unconstrained monetary-transfer model. Since the paper motivates P3 and P4 by the cost of loans, it should state this assumption explicitly and discuss whether the implications survive under feasibility constraints such as p_i >= -B_i for given budgets.","section":"Section 3"}],"minor_comments":[{"comment":"The Related Work section is a placeholder that says 'Due to time constraints, we do not survey it in this first draft' and refers readers to the authors' companion paper. The manuscript should either include a proper survey or explicitly scope itself as a research note for which the companion paper supplies the literature context.","section":"Section 2"},{"comment":"There is a typo in Remark 4.3: 'negative payent' should be 'negative payment'.","section":"Section 4, Remark 4.3"},{"comment":"The definition of T inside the lemma statement as T := max_i (W/w_i)(-p_i) is awkward. It would be clearer to phrase the assumption as 'Suppose (-p_i) <= (w_i/W) T for all i' and let T be a given bound, matching the form of part (a).","section":"Section 4, Lemma 4.3(b)"},{"comment":"The paper should state explicitly that all entitlements w_i are positive, since Lemma 4.3(b) divides by w_i and the definitions otherwise leave room for zero weights.","section":"Section 3"}],"recommendation":"major_revision","confidential_remarks":"The mathematical core is sound but the tightness claim in Lemma 4.5 and the weight-ordering ambiguity in Lemma 4.2(b) are load-bearing and need correction before publication. The note is quite short and the related-work placeholder may be an issue for journals that require self-contained literature review; this is a fit/scope matter for the editor to weigh."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Just read the note by Klein Elmalem, Gonen, and Segal-Halevi. The core is a set of lemmas connecting four payment-minimization objectives in weighted envy-free allocation: per-agent subsidy, total subsidy, max negative balanced payment, and total negative payments. The main observation is the shifting trick in Lemma 4.1, and from it the paper derives concrete conversion factors: (n-1), (W-w_1), and n/4. That is genuinely useful: anyone proving bounds in this area can now target the strongest objective and transfer the result.\n\nThe P1→P2→P3 chain is correct. Lemma 4.2's construction (subtract the minimum weighted subsidy) preserves WEF and nonnegativity, and Lemma 4.3 gives a clean equivalence between total subsidy and per-agent negative payment. The P1→P4 proof for equal entitlements is also valid as an upper bound; the affine combination of the two bounds on the same sum is a nice trick.\n\nTwo soft spots. First, Lemma 4.2(b) states the factor as (W - w_1) without saying w_1 is the smallest weight. The proof equates W - w_1 to the sum of the n-1 largest weights, which only holds in that case. As written, the lemma is not true for arbitrary labeling; it needs the min-weight qualifier or a change to W - w_min. Second, the tightness example in Lemma 4.5 assumes n even. The construction with n/2 items and equality in the affine-combination argument force k = n-k. For odd n the bound T n/4 is valid but not tight; the exact worst-case sum is floor(n^2/4) T/n. That is a small overstatement, not a fatal flaw.\n\nThe biggest weakness is structural: the paper has no related-work section and tells the reader to go to the authors' companion paper. For a note whose claim is novelty of the taxonomy, that leaves the novelty unverifiable. Also, the paper assumes balanced transfers are unbounded (agents can pay more than they own); standard in this literature, but it should be acknowledged.\n\nThis is a paper for the fair-division-with-money crowd. It saves them from re-proving these bounds and clarifies which objective to aim for. With the parity and weight-ordering fixes and at least a sketch of prior bounds, I would accept it. It deserves a serious referee.","headline":"Useful conversion-factor note for WEF with money; P1→P2→P3 chain is sound, P4 bound is correct but its tightness claim only holds for even n, and Lemma 4.2(b) needs a min-weight assumption.","tokens_in":5351,"tokens_out":11080,"would_cite":true,"duration_ms":101480,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["91B32"],"pacs":[],"model":"deepseek-v4-flash","headline":"Bounding the largest per-agent subsidy is the strongest of the four natural money-minimization objectives in weighted envy-free allocation, implying tight bounds on total subsidy, largest required payment, and total negative payments.","keywords":["weighted envy-free","subsidy","balanced payments","fair division","indivisible items","monetary transfers","quasilinear utility"],"falsifier":"Take four equal-entitlement agents, two items each valued at $T=100$ by every agent, give one item to each of agents 1 and 2, and give a subsidy of $100$ to agents 3 and 4. This WEF allocation has per-agent subsidy at most $T$; the balanced conversion $p_i = s_i - s_N/4$ should produce total negative payments of exactly $100 = Tn/4$. A single WEF allocation with $s_i \\le T$ whose balanced conversion yields more than $Tn/4$ in negative payments would falsify Lemma 4.5, and a single example where a P1 bound does not induce the claimed P2 or P3 bound would falsify the paper's central hierarchy.","tokens_in":4367,"feed_emoji":"💰","tokens_out":8963,"duration_ms":81855,"temperature":0.7,"pith_summary":"When indivisible goods are allocated with money, envy can be removed in several ways: by subsidizing some agents, by charging some agents, or by using balanced transfers that sum to zero. The paper asks which measure of \"how much money is needed\" is the right one to minimize, and compares four objectives: the largest per-agent subsidy, the total subsidy, the largest negative payment in a balanced solution, and the total of all negative payments. Its main finding is that a bound on the largest per-agent subsidy (P1) is the strongest of these: from $s_i \\le T$ for every agent one obtains a subsidy vector of total at most $(n-1)T$, a balanced WEF payment vector with $-p_i \\le \\frac{w_i}{W}(n-1)T$, and, when entitlements are equal, a balanced vector whose total negative payments are at most $Tn/4$. Each of these factors is shown to be tight, and the reverse implications fail. The practical message is that upper bounds should be proved for the per-agent subsidy objective, while lower bounds are best proved for total subsidy or total negative payments.","feed_headline":"One subsidy cap bounds all fair-payment figures","feed_subtitle":"With per-agent subsidy under T, total subsidy stays under (n-1)T and equal-entitlement transfers under Tn/4.","key_machinery":"The load-bearing mechanism is Lemma 4.1: a uniform shift of utility-per-entitlement. Starting from any WEF allocation $(A,s)$, defining $p_i = s_i - z w_i$ preserves weighted envy for every constant $z$, because the same amount is subtracted from each agent's utility per share. Choosing $z = s_N/W$ makes the payment vector balanced. This single identity converts subsidy-side bounds into balanced-payment bounds throughout the paper. The tightness arguments use allocations in which all agents receive equal utility-per-entitlement, forcing the claimed sums of payments.","core_discovery":"The paper establishes a hierarchy among four optimization objectives for weighted envy-free (WEF) allocations with monetary transfers: (P1) the maximum per-agent subsidy, (P2) the total subsidy, (P3) the largest negative payment in a balanced payment vector, and (P4) the total negative payments in a balanced vector. It proves that any bound of the form $s_i \\le T$ in a WEF subsidy allocation (P1) implies, via the linear transformation $p_i = s_i - \\frac{w_i}{W}s_N$, the existence of balanced WEF payment vectors meeting the corresponding bounds: total subsidy at most $(n-1)T$ or $(W-w_1)T$ (Lemma 4.2), negative payments at most $\\frac{w_i}{W}(n-1)T$ (Lemma 4.4), and, with equal entitlements, total negative payments at most $Tn/4$ (Lemma 4.5). The factors $(n-1)$, $(W-w_1)$, and $n/4$ are tight, illustrated by equal-utility examples such as one item worth $T$ to all agents or $n/2$ items worth $T$. The reverse directions fail, so P1 is strictly stronger than the other objectives. Extending the $n/4$ bound to general entitlements and relating the sum-of-absolute-payments objective (P5) to the others remain open.","pith_inferences":["If the affine-combination technique behind Lemma 4.5 is adapted to unequal entitlements, a plausible bound would involve the weight distribution, for example a weighted analogue of $Tn/4$; this is my editorial guess, not stated in the paper.","The transformations can require an agent to pay more than their total available funds; in budget-constrained real-world settings the hierarchy may change, with the balanced-payment objectives (P3, P4) becoming strictly harder than the subsidy objectives.","The sum-of-absolute-payments objective (P5) probably needs a bound that couples both the largest positive and largest negative payment; if such a bound exists, it would likely be a constant factor larger than the P3 bound, but the paper does not answer this."],"forward_implications":["Any algorithm that guarantees a per-agent subsidy bound $T$ for WEF allocations automatically inherits a total-subsidy bound of $(n-1)T$, so research on subsidy minimization can concentrate on the strongest objective (P1).","A bound on total subsidy is equivalent (up to weights) to a bound on the largest negative payment in a balanced WEF solution, so upper and lower bounds transfer freely between (P2) and (P3).","In the equal-entitlement case, a per-agent subsidy bound $T$ guarantees that some balanced WEF solution moves at most $Tn/4$ total money, and this ratio is best possible.","Since P1 is strictly stronger than P2, P3, and P4, impossibility results for the total-subsidy or total-payment objectives do not automatically rule out good per-agent subsidy bounds.","The paper leaves open whether the $Tn/4$ factor extends to unequal entitlements and how the sum-of-absolute-payments objective (P5) relates to the other four."],"supporting_citations":[],"fun_headline_variants":["One per-agent T forces all fair-payment bounds","Per-agent subsidy cap is the strictest fair-payment goal","From per-agent T to total (n-1)T: tight payment bound","Subsidy cap T bounds all fair-payment totals","Fair payments: one subsidy cap sets every bound"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The transformations assume unbounded monetary transfers: the constructed balanced vector $p_i = s_i - \\frac{w_i}{W}s_N$ can make an agent pay more than they own, and if agents cannot make such payments the equivalence between the objectives collapses.","fun_headline_variants_meta":{"raw":{"variants":["One per-agent T forces all fair-payment bounds","Per-agent subsidy cap is the strictest fair-payment goal","From per-agent T to total (n-1)T: tight payment bound","Subsidy cap T bounds all fair-payment totals","Fair payments: one subsidy cap sets every bound"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000991,"raw_usage":{"total_tokens":4184,"prompt_tokens":911,"completion_tokens":3273,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":527,"completion_tokens_details":{"reasoning_tokens":3190}},"tokens_in":527,"tokens_out":3273,"duration_ms":26176,"temperature":1.0,"reasoning_tokens":3190,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T18:43:24.016489+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Take four equal-entitlement agents, two items each valued at $T=100$ by every agent, give one item to each of agents 1 and 2, and give a subsidy of $100$ to agents 3 and 4. This WEF allocation has per-agent subsidy at most $T$; the balanced conversion $p_i = s_i - s_N/4$ should produce total negative payments of exactly $100 = Tn/4$. A single WEF allocation with $s_i \\le T$ whose balanced conversion yields more than $Tn/4$ in negative payments would falsify Lemma 4.5, and a single example where a P1 bound does not induce the claimed P2 or P3 bound would falsify the paper's central hierarchy.","supporting_citations":[],"review_version":2}