Christiane Lemieux

Christiane Lemieux

Auto-generated profile, based on publicly available information

Christiane Lemieux

Department of Statistics and Actuarial Science, University of Waterloo, Waterloo, Canada

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 December 2015 in ASTIN Bulletin
Verified
Journal Article
Closed access
PDF file
JCJun Cai
Jun Cai
CLChristiane Lemieux
Christiane Lemieux
FLFangda Liu
Fangda Liu
Optimal reinsurance from an insurer's point of view or from a reinsurer's point of view has been studied extensively in the literature. However, as two parties of a reinsurance contract, an insurer and a reinsurer have conflicting interests. An optimal form of reinsurance from one party's point of view may be not acceptable to the other party. In this paper, we study optimal reinsurance designs from the perspectives of both an insurer and a reinsurer and take into account both an insurer's aims and a reinsurer's goals in reinsurance contract designs. We develop optimal reinsurance contracts that minimize the convex combination of the Value-at-Risk (VaR) risk measures of the insurer's loss and the reinsurer's loss under two types of constraints, respectively. The constraints describe the interests of both the insurer and the reinsurer. With the first type of constraints, the insurer and the reinsurer each have their limit on the VaR of their own loss. With the second type of constraints, the insurer has a limit on the VaR of his loss while the reinsurer has a target on his profit from selling a reinsurance contract. For both types of constraints, we derive the optimal reinsurance forms in a wide class of reinsurance policies and under the expected value reinsurance premium principle. These optimal reinsurance forms are more complicated than the optimal reinsurance contracts from the perspective of one party only. The proposed models can also be reduced to the problems of minimizing the VaR of one party's loss under the constraints on the interests of both the insurer and the reinsurer.

1 February 2018 in Mathematics of Operations Research
Verified
Journal Article
Closed access
CLChristiane Lemieux
Christiane Lemieux
In this paper, we provide a framework to study the dependence structure of sampling schemes such as those produced by randomized quasi-Monte Carlo methods. The main goal of this new framework is to determine conditions under which the negative dependence structure of a sampling scheme enables the construction of estimators with reduced variance compared to Monte Carlo estimators. To do this, we establish a generalization of the well-known Hoeffding’s lemma—expressing the covariance of two random variables as an integral of the difference between their joint distribution function and the product of their marginal distribution functions—that is particularly well suited to study such sampling schemes. We also provide explicit formulas for the joint distribution of pairs of points randomly chosen from a scrambled (0, m, s)-net. In addition, we provide variance bounds establishing the superiority of dependent sampling schemes over Monte Carlo in a few different setups. In particular, we show that a scrambled (0, m, 2)-net yields an estimator with variance no larger than a Monte Carlo estimator for functions monotone in each variable.

5 August 2016 in Statistics and Computing
Verified
Journal Article
Closed access
PDF file
MCMathieu Cambou
Mathieu Cambou
MHMarius Hofert
Marius Hofert
CLChristiane Lemieux
Christiane Lemieux

10 January 2021 in Monte Carlo Methods and Applications
Verified
Journal Article
Closed access
JWJaspar Wiart
Jaspar Wiart
CLChristiane Lemieux
Christiane Lemieux
GDGracia Y. Dong
Gracia Y. Dong
In this paper we develop a framework to study the dependence structure of scrambled ( t , m , s ) {(t,m,s)} -nets. It relies on values denoted by C b ⁢ ( 𝒌 ; P n ) {C_{b}({\boldsymbol{k}};P_{n})} , which are related to how many distinct pairs of points from P n {P_{n}} lie in the same elementary 𝒌 {{\boldsymbol{k}}} -interval in base b. These values quantify the equidistribution properties of P n {P_{n}} in a more informative way than the parameter t. They also play a key role in determining if a scrambled set P ~ n {\widetilde{P}_{n}} is negative lower orthant dependent (NLOD). Indeed, this property holds if and only if C b ⁢ ( 𝒌 ; P n ) ≤ 1 {C_{b}({\boldsymbol{k}};P_{n})\leq 1} for all 𝒌 ∈ ℕ s {{\boldsymbol{k}}\in\mathbb{N}^{s}} , which in turn implies that a scrambled digital ( t , m , s ) {(t,m,s)} -net in base b is NLOD if and only if t = 0 {t=0} . Through numerical examples we demonstrate that these C b ⁢ ( 𝒌 ; P n ) {C_{b}({\boldsymbol{k}};P_{n})} values are a powerful tool to compare the quality of different ( t , m , s ) {(t,m,s)} -nets, and to enhance our understanding of how scrambling can improve the quality of deterministic point sets.

1 July 2019 in Mathematics and Computers in Simulation
Verified
Journal Article
Closed access
HFHenri Faure
Henri Faure
CLChristiane Lemieux
Christiane Lemieux

1 January 2012 in Acta Arithmetica
Verified
Journal Article
Open access
PDF file
HFHenri Faure
Henri Faure
CLChristiane Lemieux
Christiane Lemieux