A polynomial-time algorithm computes fractional claims trades and donations that rescue a creditor without harming the buyer, and NP-hardness is shown for trades of a common debtor's claims under default costs.
Uniqueness of clearing payment matrices in financial networks
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Fractional Claims Trades and Donations in Financial Networks
A polynomial-time algorithm computes fractional claims trades and donations that rescue a creditor without harming the buyer, and NP-hardness is shown for trades of a common debtor's claims under default costs.