Out of the companies, Dolby is the company with the best overall financial and operation health. According to the table that accounted its financial statements for the past three years, Dolby has stable profit margins that generates a revenue in the billions, the only company in ten figures.

In a discrete-time financial market, a generalized duality is established for model-free superhedging, given marginal distributions of the underlying asset. Contrary to prior studies, we do not require contingent claims to be upper semicontinuous, allowing for upper semi-analytic ones. The generalized duality stipulates an extended version of risk-neutral pricing. To compute the model-free superhedging price, one needs to find the supremum of expected values of a contingent claim, evaluated not directly under martingale (risk-neutral) measures, but along sequences of measures that converge, in an appropriate sense, to martingale ones. To derive the main result, we first establish a portfolio-constrained duality for upper semi-analytic contingent claims, relying on Choquet's capacitability theorem. As we gradually fade out the portfolio constraint, the generalized duality emerges through delicate probabilistic estimations.

We consider indifference pricing of contingent claims consisting of payment flows in a discrete time model with proportional transaction costs and under exponential disutility. This setting covers utility maximisation as a special case. A dual representation is obtained for the associated disutility minimisation problem, together with a dynamic procedure for solving it. This leads to an efficient and convergent numerical procedure for indifference pricing which applies to a wide range of payoffs, a large range of time steps and all magnitudes of transaction costs.

Credit scoring models support loan approval decisions in the financial services industry. Lenders train these models on data from previously granted credit applications, where the borrowers' repayment behavior has been observed. This approach creates sample bias. The scoring model (i.e., classifier) is trained on accepted cases only. Applying the resulting model to screen credit applications from the population of all borrowers degrades model performance. Reject inference comprises techniques to overcome sampling bias through assigning labels to rejected cases. The paper makes two contributions. First, we propose a self-learning framework for reject inference. The framework is geared toward real-world credit scoring requirements through considering distinct training regimes for iterative labeling and model training. Second, we introduce a new measure to assess the effectiveness of reject inference strategies. Our measure leverages domain knowledge to avoid artificial labeling of rejected cases during strategy evaluation. We demonstrate this approach to offer a robust and operational assessment of reject inference strategies. Experiments on a real-world credit scoring data set confirm the superiority of the adjusted self-learning framework over regular self-learning and previous reject inference strategies. We also find strong evidence in favor of the proposed evaluation measure assessing reject inference strategies more reliably, raising the performance of the eventual credit scoring model.