{"id":"e8e7b783-a4e3-45ed-8801-10aad34e1ff4","arxiv_id":"2611.17029","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"In many-to-many matching with contracts, efficient individually rational mechanisms rule out best-case obvious manipulation, but stable mechanisms admit it under natural conditions; doctor-proposing deferred acceptance is non-obviously manipulable under unitary preferences.","lead":"This paper studies how the structure of contracts affects whether matching mechanisms can be obviously manipulated by doctors. It finds that efficient mechanisms prevent best-case manipulations, but stable mechanisms often allow them, while doctor-proposing deferred acceptance is immune under unitary preferences.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek/deepseek-v4-flash","headline":"No significant objection identified","rationale":"The reader's weakest_assumption is that hospitals' preferences are fixed and common knowledge. The paper explicitly states this as a scope condition (b31-b32, b134). The reader correctly notes that this is a limitation but does not treat it as a flaw. The paper's central claims are all conditional on this information structure. The proofs are rigorous and the limitations are acknowledged. No load-bearing concern was identified that would change the verdict.","tokens_in":17587,"tokens_out":277,"duration_ms":10086,"concrete_test":"Re-run the proof of Theorem 5 with a non-unitary preference to verify that the unitary assumption is indeed necessary for the NOM result. If the proof fails without unitarity, the scope condition is correctly identified.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper is a careful theoretical analysis within its stated scope. The proofs are rigorous, the assumptions are clearly stated, and the limitations are acknowledged. The results extend the literature on obvious manipulation to many-to-many matching with contracts, providing both negative and positive findings. The paper does not overclaim; it explicitly states that the conditions are sufficient, not necessary. No red flags were detected. The verdict is ACCEPT.","agreement_with_reader":"agree"},"referee_report":null,"author_rebuttal":null,"desk_editor":{"model":"deepseek/deepseek-v4-flash","letter":"This paper extends the obvious-manipulation framework to many-to-many matching with contracts, which is a natural next step after Arribillaga and Pepa Risma (2025) on many-to-one markets. The main contribution is systematic: it separates worst-case and best-case comparisons and shows how contractual structure (competing contracts, protection, replacement with competition) drives manipulability.\n\nWhat it does well: Theorem 1 is a crisp, general result—efficient individually rational mechanisms never admit best-case obvious manipulations, on either domain. The proof is short and uses only efficiency and individual rationality. The negative results (Theorems 2–4) are clearly stated with sufficient conditions that are economically interpretable. The paper is honest about scope: it repeatedly says the conditions are sufficient, not necessary, and it flags the fixed-hospital-preferences information structure.\n\nSoft spots: The positive results are more limited than the abstract might suggest. Theorem 5 (DDAM is NOM on the unitary domain) is the main positive, but the proof is long and relies on a construction (the auxiliary markets and the completion argument) that is clever but hard to verify quickly. Theorem 6 extends NOM to all stable-dominating mechanisms only under the strong restriction that each doctor–hospital pair has at most one feasible contract—which essentially collapses the model to classical many-to-many matching without contracts. That is a real limitation, and the paper acknowledges it, but it means the positive reach is narrower than the negative reach.\n\nAlso, the paper does not characterize NOM on the unitary domain; it leaves open which stable mechanisms are NOM there. The comparison table (Table 1) is useful but the entry for stable mechanisms on the unitary domain says \"Depends on the mechanism\"—that is honest but also a gap.\n\nWho this is for: theorists working on matching market design, especially those interested in incentive properties beyond strategy-proofness. The paper is well-written and the proofs are rigorous. It deserves a serious referee.\n\nRecommendation: Accept with minor revisions. The main suggestions would be to clarify the scope of Theorem 6 earlier (the pair-restriction is strong) and to consider adding a brief discussion of whether the fixed-hospital-preferences assumption is restrictive in practice.","headline":"Solid extension of NOM to many-to-many matching with contracts; the efficiency result (Theorem 1) is clean and the negative conditions are well-motivated, but the positive results (Theorems 5 and 6) are narrower than they first appear.","tokens_in":18210,"tokens_out":576,"duration_ms":7902},"pith_extraction":null,"created_at":"2026-11-13T07:15:03.195916+00:00","model_set":{"reader":"deepseek/deepseek-v4-flash"},"pipeline_version":"pith-pipeline@v1.4.1-daily-deepseek-or-medium","input_kind":null,"input_chars":null,"input_total_chars":null,"passes_missing":null,"published_standing":null,"published_confidence":null,"objection_audit":null,"run_record":null,"basis":{"kind":"not_recorded","source":null,"chars_given":null,"chars_total":null},"receipt":null,"falsifier":null,"supporting_citations":[],"lane_accuracy":{"status":"not yet measured","lane":{"model":"deepseek/deepseek-v4-flash","input_kind":null},"url":"https://pith.science/accuracy"},"review_version":1}