{"title":"交易对手信用风险的连贯全球市场模拟","authors":"C. Albanese","doi":"10.1109/WHPCF.2010.5671842","DOIUrl":null,"url":null,"abstract":"Valuing and hedging counterparty credit risk involves analyzing large portfolios of netting sets over time horizons of decades. Theory dictates that the simulation measure should be coherent, i.e. arbitrage free and be used consistently both for simulation and valuation. This talk describes the mathematical formalism and the software architecture of a risk system that accomplishes this task while delivering a very rich set of 3-dimensional risk metrics to the end user, including portfolio loss distributions and sensitivities thereof. The network communication bottleneck is bypassed by using capable boards with acceleration. The memory bottleneck is overcome at the algorithmic level by adapting the mathematical framework to revolve around a handful of compute bound algorithms.","PeriodicalId":408567,"journal":{"name":"2010 IEEE Workshop on High Performance Computational Finance","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Coherent global market simulations for counterparty credit risk\",\"authors\":\"C. Albanese\",\"doi\":\"10.1109/WHPCF.2010.5671842\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Valuing and hedging counterparty credit risk involves analyzing large portfolios of netting sets over time horizons of decades. Theory dictates that the simulation measure should be coherent, i.e. arbitrage free and be used consistently both for simulation and valuation. This talk describes the mathematical formalism and the software architecture of a risk system that accomplishes this task while delivering a very rich set of 3-dimensional risk metrics to the end user, including portfolio loss distributions and sensitivities thereof. The network communication bottleneck is bypassed by using capable boards with acceleration. The memory bottleneck is overcome at the algorithmic level by adapting the mathematical framework to revolve around a handful of compute bound algorithms.\",\"PeriodicalId\":408567,\"journal\":{\"name\":\"2010 IEEE Workshop on High Performance Computational Finance\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE Workshop on High Performance Computational Finance\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WHPCF.2010.5671842\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Workshop on High Performance Computational Finance","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WHPCF.2010.5671842","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Coherent global market simulations for counterparty credit risk
Valuing and hedging counterparty credit risk involves analyzing large portfolios of netting sets over time horizons of decades. Theory dictates that the simulation measure should be coherent, i.e. arbitrage free and be used consistently both for simulation and valuation. This talk describes the mathematical formalism and the software architecture of a risk system that accomplishes this task while delivering a very rich set of 3-dimensional risk metrics to the end user, including portfolio loss distributions and sensitivities thereof. The network communication bottleneck is bypassed by using capable boards with acceleration. The memory bottleneck is overcome at the algorithmic level by adapting the mathematical framework to revolve around a handful of compute bound algorithms.