{"id":"40e96ccf-df2e-49a4-bd3d-40b75b63b693","arxiv_id":"1908.01714","paper_version":3,"verdict":"ACCEPT","confidence":"MODERATE","novelty_score":7.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"In a strategic model of debt repayment, ranking individual payment units guarantees a socially optimal strong equilibrium, while ranking whole debt contracts can make equilibrium existence NP-hard or impossible.","lead":"This paper studies what happens when banks in a debt network are free to choose which debts to pay first. It shows that if payments can be ordered one small unit of money at a time, there is always a stable, socially optimal way to clear the network, while simpler whole-loan rankings can destroy stability and make good outcomes hard to find.","discovery_kind":"new_application","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 6 is sound under the paper's maximal-clearing-state tie-break, but that tie-break is load-bearing: an alternative selection rule (e.g., minimal) could destroy the optimal-revenue strong equilibrium.","rationale":"I read the proof of Theorem 6 as internally sound: the threshold profile constructed from a maximum circulation is feasible, and the coalition-deviation argument correctly produces a cycle of edges with strictly higher flow, which would augment the maximum circulation and contradict optimality. The same reasoning does not depend on which clearing state is selected after a deviation, but it does depend on the original profile being evaluated at the maximal clearing state so that the optimal circulation is realized. The paper states this tie-breaking rule explicitly, so there is no hidden error; however, the rule is also the only place where the central existence result could fail under a different, equally plausible clearing convention. The reader's verdict identified the same assumption. I agree with the reader that this is a caveat rather than a correctness defect, and I would not change the ACCEPT verdict on the basis of it. The concrete test I propose would establish whether the assumption is merely conventional or genuinely essential to the result, and it is a cheap check on small instances.","tokens_in":20240,"tokens_out":17987,"duration_ms":211770,"concrete_test":"Construct a small coin-ranking game (e.g., two overlapping cycles with threshold strategies chosen so that Theorem 3 yields multiple fixed points) and enumerate all threshold strategy profiles. For each profile, compute utilities twice: once with the coordinate-wise maximal clearing state and once with the coordinate-wise minimal clearing state. Under the minimal rule, check whether any profile is a strong equilibrium whose minimal clearing state has total revenue equal to the maximum circulation value. If a counterexample exists, the tie-breaking rule is essential to Theorem 6; if an optimal-revenue strong equilibrium always exists, the concern does not land.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is proven correctly within the stated model, but its force depends on the tie-breaking rule in Section 1.3, 'Clearing States and Utilities': utility is read off the coordinate-wise maximal clearing state. This is load-bearing because Theorem 6 constructs a threshold strategy profile from an optimal circulation f* and shows no coalition can improve relative to the maximal clearing state of that profile. If a clearing mechanism instead resolved the fixed-point multiplicity by choosing, for example, the coordinate-wise minimal clearing state, the same profile would not necessarily realize the revenue-maximizing flows, and the paper gives no argument that any other profile is an optimal-revenue strong equilibrium under that rule. Multiple clearing states are not a degenerate exception: Theorem 3 shows the fixed-point set forms a lattice for every monotone strategy profile, and the whole lattice machinery is used to justify the chosen state. Thus the normative conclusion that a centralized bankruptcy settlement can achieve a socially optimal strong equilibrium is contingent on an optimistic, non-obvious selection rule.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper analyzes a game-theoretic variant of the Eisenberg-Noe clearing model. Each firm is a node in a directed liability network and chooses a payment strategy—either an edge-ranking or a coin-ranking strategy—that specifies how its available assets are allocated to outgoing obligations. For a fixed strategy profile, clearing states are asset vectors satisfying a fixed-point equation; the paper defines utility through the coordinate-wise maximal such state, which maximizes total assets. The authors prove structural results (clearing states form a lattice for monotone strategies, and the maximal state is computable in strongly polynomial time) and then give an extensive equilibrium analysis. In coin-ranking games, there always exists a strong equilibrium whose flows maximize total revenue and it is computable in polynomial time (Theorem 6), although best responses are strongly NP-hard to compute (Theorem 9). The strong price of anarchy is bounded by the min-max cycle length of an optimal circulation (Theorem 11) with a matching lower bound (Proposition 12), while the Nash price of anarchy is unbounded (Proposition 10). Edge-ranking games behave much worse: pure Nash and strong equilibria can be absent, and deciding existence, computing equilibria, and computing a social optimum are strongly NP-hard (Theorem 14); moreover, the strong price of stability can be linear in n and the Nash price of stability unbounded (Propositions 16 and 17).","tokens_in":20338,"tokens_out":33250,"duration_ms":367633,"significance":"If the results hold, the paper provides a crisp algorithmic dichotomy with a striking positive conclusion: when firms may rank individual units of money, a centralized clearing authority can compute, in strongly polynomial time, a strong equilibrium that also maximizes total revenue. This stands against the edge-ranking case, where equilibria may not exist and all natural decision problems are intractable. The paper's strengths include explicit constructions in hardness reductions, a lattice-based fixed-point analysis, and tight bounds on the strong price of anarchy. There are no fitted parameters or calibrated quantities; all statements are derived from the model definitions. The two main caveats are the choice of the maximal clearing state as the payoff-relevant outcome, which is load-bearing for Theorem 6, and a gap in the proof of the strong price of anarchy bound in Theorem 11.","major_comments":[{"comment":"The central positive result is stated for utilities defined by the coordinate-wise maximal clearing state, and this tie-breaking rule is load-bearing. Theorem 6 constructs a threshold strategy profile from an optimal circulation f* and proves that no coalition can improve relative to the maximal clearing state of that profile. If a clearing mechanism resolved the fixed-point multiplicity differently, for example by selecting the coordinate-wise minimal state, the same profile need not realize the revenue-maximizing flows, and the paper supplies no argument that any other profile is an optimal-revenue strong equilibrium under such a rule. Since Theorem 3 shows that multiple clearing states are not a degenerate exception, the normative conclusion in the abstract and introduction—that centralized bankruptcy settlement can achieve a socially optimal strong equilibrium—is contingent on an optimistic, non-obvious selection rule. The paper should either justify the maximal-state rule as the right model of a clearing mechanism or explicitly qualify the policy conclusion as depending on that rule.","section":"Section 1.3 (Clearing States and Utilities) and Theorem 6"},{"comment":"The proof of the strong price of anarchy bound needs clarification. The cycles Ci in the decomposition of f* are cycles of the auxiliary circulation network G′, as indicated by the revenue identity Rev(f*) = Sum_i |Ci| − Sum_v ax_v. For a cycle that contains the auxiliary source s, the firms on that cycle cannot rank the auxiliary edges (s,v) and (v,s), so the proposed joint deviation cannot be implemented in the way described. Moreover, the first firm on such a cycle already receives its external assets through a saturated edge (s,v); rerouting those assets along the cycle is a reallocation rather than an addition of new flow, and that firm may lose returns from its previous allocation, so it is not clear that every firm in the coalition strictly gains. If the intended decomposition contains only cycles of the original network, then the revenue identity is incorrect when external assets are present. The proof should state the intended restriction on the cycles and provide a separate argument for cycles that pass through the auxiliary source.","section":"Section 3.3, proof of Theorem 11"}],"minor_comments":[{"comment":"The manuscript's own title is 'Strategic Payments in Financial Networks,' whereas the arXiv metadata lists 'Flow Allocation Games'; please align the metadata with the manuscript title.","section":"Title and metadata"},{"comment":"Proposition 1 is stated without proof and justified only by a citation to Brouwer's fixed-point theorem; since the paper later develops its own lattice-based fixed-point analysis, a short proof or a more explicit reference would make the section self-contained.","section":"Section 1.3, Proposition 1"},{"comment":"The proof of Proposition 16 is hard to follow and appears to refer to a construction different from the one in Proposition 12; in particular, the statement that 'the only node with more than a single outgoing edge is still v1' is not consistent with the Proposition 12 construction, in which nodes v2,...,vd have multiple outgoing edges. Please rewrite the construction so that the claimed lower bound can be verified.","section":"Section 4.2, Proposition 16"},{"comment":"In the sentence 'Observe that firms c1,...,cm and x1,...,xn each have a single outgoing edge,' the symbols x1,...,xn appear to be a typo for z1,...,zn; please correct this and make the naming of variable-gadget firms consistent throughout the proof.","section":"Appendix A.1, proof of Theorem 9"},{"comment":"The phrase 'saturates all outgoing auxiliary edges from s' should more precisely read 'saturates all auxiliary edges (s,v)' so as not to conflict with the auxiliary edges (v,s) that carry surplus flow back to the source.","section":"Section 3.2, proof of Theorem 6"}],"recommendation":"major_revision","confidential_remarks":"The paper is technically interesting and likely correct in its main lines, but the two major comments above concern load-bearing points. The tie-breaking issue is partly a modeling choice, and the authors may be able to address it with an explicit discussion or a weakened policy claim. The Theorem 11 proof gap should be repairable with a clearer treatment of cycles involving the auxiliary source; if the authors can close that gap, I would be supportive of acceptance."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Two things you should know. First, this is a real contribution: it introduces a strategic version of Eisenberg-Noe clearing where firms choose payment priorities, and it draws a sharp, non-obvious line between two natural strategy classes. Coin-ranking (unit-level priorities) always admits a strong equilibrium that maximizes total revenue and is computable in polynomial time. Edge-ranking (contract-level priorities) can have no pure Nash equilibrium at all, and deciding existence is strongly NP-hard. That dichotomy is the paper's core value, and it holds up. Second, the paper is honest about its main modeling choice: utility is read off the coordinate-wise maximal clearing state, which is also the revenue-maximizing one. The lattice theorem (Theorem 3) justifies that there is a unique maximal state, and the authors are explicit that they select it. That is a defensible convention, but it is not innocuous.\n\nThe technical work is generally careful. The lattice proof is a clean application of Knaster-Tarski. Theorem 6's strong-equilibrium argument is elegant: from an optimal circulation, threshold strategies make any profitable coalitional deviation imply a flow-augmenting cycle, contradicting optimality. The price-of-anarchy bound in Theorem 11 via cycle covers is neat, and the lower-bound constructions (Propositions 12, 16, 17) are explicit and plausible. The reductions in Appendix A.3 are standard and the constructions look correct. The proof of Proposition 1 is omitted (just a Brouwer citation), which is minor since the result is standard and the paper focuses on monotone strategies where Tarski applies. Some of the price-of-anarchy/stability proofs are a bit compressed, but not wrong as far as I can tell.\n\nThe soft spots are the two caveats you already identified. The maximal-clearing-state tie-break is load-bearing: Theorem 6's strong equilibrium is optimal only under that selection rule. If a clearing mechanism instead picked the minimal fixed point, the same threshold profile need not be optimal, and the paper gives no existence result for that case. This limits the force of the normative conclusion that a centralized bankruptcy settlement can always implement a socially optimal strong equilibrium. The integrality assumption is a genuine restriction, though the authors state it plainly (all inputs integer) and it is standard for complexity results. It is also worth noting that the strategic relevance is mostly for insolvent firms; solvent firms are indifferent, as Proposition 4 shows. That is a feature of the model, but it also delimits the application.\n\nOn the stress-test note: I think the concern is correct but not fatal. The paper is transparent about the tie-break and motivates it as the revenue-maximizing selection; the results are true within that stated model. The flaw is not in the proofs but in the implicit claim that this tie-break is the natural or obvious one for bankruptcy settlement. A referee should push on this, but it is a modeling caveat, not a formal gap.\n\nWho is this for? Anyone working on financial networks, clearing mechanisms, or strategic flow games. It is a well-cited paper in that community already, and it deserves serious referee time. I would accept it for peer review and recommend publication after the tie-break discussion is made more prominent. I would cite it if I worked on incentives in clearing. Take it to reading group as a nice example of how strategic choice of payment rules changes equilibrium existence.","headline":"A solid, well-executed game-theoretic analysis of strategic payment priorities in Eisenberg-Noe networks; the coin-ranking vs. edge-ranking dichotomy is genuine and the paper deserves peer review, though the maximal-clearing-state tie-break is a load-bearing modeling choice that should be flagged.","tokens_in":20905,"tokens_out":821,"would_cite":true,"duration_ms":11105,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["91A43","91A68"],"pacs":[],"model":"deepseek-v4-flash","headline":"In financial networks where firms rank payments by individual coins, there is always a strong equilibrium whose money flows maximize total revenue, and it can be computed in polynomial time.","keywords":["financial networks","clearing mechanisms","strong equilibrium","pure Nash equilibrium","price of anarchy","price of stability","strategic flow games","maximum circulation"],"falsifier":"Exhaustively search all small coin-ranking games, say up to six firms with unit debts and external assets, and for each compute the maximum circulation $f^*$, assign threshold strategies with thresholds equal to $f^*_e$, and check by coalition-deviation search whether any coalition strictly improves; because the paper claims none can, a single violation would refute Theorem 6.","tokens_in":19996,"feed_emoji":"💰","tokens_out":8296,"duration_ms":80436,"temperature":0.7,"pith_summary":"The paper analyzes a strategic version of the classical clearing model for financial networks, in which each firm chooses how to allocate the money it receives to its own debts. It claims that when firms are allowed to rank individual units of money, every network has a strong equilibrium—a payment profile that no coalition of firms can profitably overturn—and that this equilibrium simultaneously maximizes the total revenue available to all firms. This matters because it gives a centralized bankruptcy settlement rule that is socially optimal and coalition-proof, computable in strongly polynomial time. The paper contrasts this with the more intuitive case where firms rank whole debt contracts: there, equilibria can fail to exist, and deciding whether one exists is strongly NP-hard.","feed_headline":"Coin-level payment rankings always admit optimal equilibria","feed_subtitle":"Ranking individual coins lets a settlement maximize all firms' assets and block every deviating coalition; contract-level rankings fail.","key_machinery":"The argument is carried by a circulation reformulation. Add an auxiliary source connected to each firm by an edge of capacity equal to that firm's external assets, and connect each firm back to the source by an unbounded edge; every clearing state then corresponds to a circulation in which all source edges are saturated. The revenue-maximizing circulation $f^*$ is computed in strongly polynomial time, and each firm is assigned a threshold-ranking strategy that pays exactly $f^*_e$ to each outgoing edge $e$ before paying the remainder of any debt. The proof that no coalition can profitably deviate chases a cycle: a strictly improving deviation would create a cycle of increased flow, contradicting optimality of $f^*$. A lattice theorem for clearing states justifies reading utilities from the coordinate-wise maximal clearing state for every strategy profile, and that state is computable in strongly polynomial time.","core_discovery":"The central discovery is that the strategic payment game has two sharply different regimes depending on how priorities are expressed. In a coin-ranking game, where each firm's strategy distributes single units of money monotonically to its debts, the revenue-maximizing circulation in the auxiliary network is itself the clearing outcome of a strong equilibrium: no coalition can strictly improve all of its members, even if deviating firms may use arbitrary continuous strategies and any clearing state may be chosen for the deviation (Theorem 6 with Remark 7). Moreover, this strong equilibrium maximizes total revenue and can be computed in strongly polynomial time. In an edge-ranking game, where priorities are over whole debt contracts rather than coins, pure Nash and strong equilibria need not exist, and deciding existence, computing equilibria, and computing socially optimal profiles are all strongly NP-hard (Theorems 13 and 14).","pith_inferences":["If a clearing mechanism resolved multiple fixed points by the coordinate-wise minimal state instead of the maximal one, the Theorem 6 construction would not obviously survive; the existence of an optimal strong equilibrium is sensitive to this tie-breaking choice.","A regulatory reading the paper does not test is that settlement protocols should be written as unit-level priority rules, equivalently threshold payments, since the dichotomy suggests this small implementation detail decides whether optimal coalition-proof clearing is possible.","The unbounded Nash price of anarchy combined with the bounded strong price of anarchy indicates that decentralized clearing performance depends on coordinated payment cycles rather than individual optimization; whether real interbank networks exhibit such cycles is an empirical question."],"forward_implications":["A regulator who can assign unit-level payment priorities can implement a clearing profile that maximizes total assets and is stable against coalitional deviations, using a strongly polynomial algorithm.","In coin-ranking games the strong price of anarchy is bounded by the minimum, over all optimal circulations and cycle decompositions, of the largest cycle length; optimal networks built from short payment cycles have nearly optimal strong equilibria.","The pure Nash price of anarchy in coin-ranking games is unbounded even without external assets, so stability against unilateral deviations alone gives no revenue guarantee.","Edge-ranking games can have no pure Nash or strong equilibrium; deciding existence and computing equilibria or optimal revenue are strongly NP-hard.","The best strong equilibrium in an edge-ranking game can be a factor $\\Omega(n)$ worse than the social optimum, and the price of stability can be unbounded."],"supporting_citations":[{"why":"Supplies the underlying clearing model: firms, liabilities, and the fixed-point equations that define clearing states.","marker":"[12]"},{"why":"Supplies the strongly polynomial minimum-cost circulation algorithm used to compute the revenue-maximizing circulation in Theorem 6.","marker":"[30]"},{"why":"Provides the lattice structure for stable flows that informs the analogous lattice theorem for clearing states.","marker":"[15]"},{"why":"Supplies the strongly NP-complete three-dimensional matching problem used as the reduction source for edge-ranking hardness.","marker":"[22]"}],"fun_headline_variants":["Rank coins, not contracts: optimal equilibrium guaranteed","Coin-level priorities always yield optimal strong equilibria","Payment flow games: coin ranking optimal, edge ranking NP-hard","Coin-by-coin strategy ensures optimal settlement; contract fails","In clearing networks, coin ranking wins over edge ranking"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that utilities are read from the revenue-maximizing, coordinate-wise largest clearing state for each strategy profile; if a clearing system resolved ties toward a smaller fixed point, existence of an optimal strong equilibrium could change.","fun_headline_variants_meta":{"raw":{"variants":["Rank coins, not contracts: optimal equilibrium guaranteed","Coin-level priorities always yield optimal strong equilibria","Payment flow games: coin ranking optimal, edge ranking NP-hard","Coin-by-coin strategy ensures optimal settlement; contract fails","In clearing networks, coin ranking wins over edge ranking"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000369,"raw_usage":{"total_tokens":1932,"prompt_tokens":853,"completion_tokens":1079,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":469,"completion_tokens_details":{"reasoning_tokens":1002}},"tokens_in":469,"tokens_out":1079,"duration_ms":10750,"temperature":1.0,"reasoning_tokens":1002,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T15:05:32.903782+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Exhaustively search all small coin-ranking games, say up to six firms with unit debts and external assets, and for each compute the maximum circulation $f^*$, assign threshold strategies with thresholds equal to $f^*_e$, and check by coalition-deviation search whether any coalition strictly improves; because the paper claims none can, a single violation would refute Theorem 6.","supporting_citations":[{"cited_title":"Systemic risk in financi al systems","cited_arxiv_id":null,"evidence_quote":"Supplies the underlying clearing model: firms, liabilities, and the fixed-point equations that define clearing states."},{"cited_title":"A strongly polynomial minimum cost circulation algorithm","cited_arxiv_id":null,"evidence_quote":"Supplies the strongly polynomial minimum-cost circulation algorithm used to compute the revenue-maximizing circulation in Theorem 6."},{"cited_title":"On stable matchings and flows","cited_arxiv_id":null,"evidence_quote":"Provides the lattice structure for stable flows that informs the analogous lattice theorem for clearing states."},{"cited_title":"Reducibility among combinatorial probl ems","cited_arxiv_id":null,"evidence_quote":"Supplies the strongly NP-complete three-dimensional matching problem used as the reduction source for edge-ranking hardness."}],"review_version":1}