Financial networks with singleton liability priorities
From MaRDI portal
(Redirected from Publication:6164510)
Financial networks with singleton liability priorities (scientific article; zbMATH DE number 7719860)
Financial networks with singleton liability priorities (scientific article; zbMATH DE number 7719860)
Recommendations
Cites work
- A problem that is easier to solve on the unit-cost algebraic RAM
- Decreasing the nesting depth of expressions involving square roots
- Default ambiguity: finding the best solution to the clearing problem
- Equilibria, fixed points, and complexity classes
- Financial networks with singleton liability priorities
- scientific article; zbMATH DE number 3588048 (Why is no real title available?)
- scientific article; zbMATH DE number 3637287 (Why is no real title available?)
- scientific article; zbMATH DE number 6866322 (Why is no real title available?)
- scientific article; zbMATH DE number 7650394 (Why is no real title available?)
- On the Complexity of Equilibrium Computation in First-Price Auctions
- On the Complexity of Nash Equilibria and Other Fixed Points
- Sensitivity and computational complexity in financial networks
- Systemic risk in financial systems
- The Euclidean traveling salesman problem is NP-complete
- The Hairy Ball problem is PPAD-complete
Cited in
(8)- Default ambiguity: finding the best solution to the clearing problem
- Certifiably pseudorandom financial derivatives
- Financial networks with singleton liability priorities
- Seniorities and minimal clearing in financial network games
- Financial networks with singleton liability priorities
- Algorithms for claims trading
- Strong approximations and irrationality in financial networks with derivatives
- Clearing financial networks with derivatives: from intractability to algorithms
This page was built for publication: Financial networks with singleton liability priorities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164510)