Related papers: On the strict comparison theorem for $G$-expectati…
Sufficient and necessary conditions are presented for the comparison theorem of path dependent $G$-SDEs. Different from the corresponding study in path independent $G$-SDEs, a probability method is applied to prove these results. Moreover,…
Under the sublinear expectation $\mathbb{E}[\cdot]:=\sup_{\theta\in \Theta} E_\theta[\cdot]$ for a given set of linear expectations $\{E_\theta: \theta\in \Theta\}$, we establish a new law of large numbers and a new central limit theorem…
In this paper, on the sublinear expectation space, we establish a comparison theorem between independent and convolutionary random vectors, which states that the partial sums of those two sequences of random vectors are identically…
We investigate the concept of strong equivalence within the extended framework of Answer Set Programming with constraints. Two groups of rules are considered strongly equivalent if, informally speaking, they have the same meaning in any…
Although reasoning about equations over strings has been extensively studied for several decades, little research has been done for equational reasoning on general clauses over strings. This paper introduces a new superposition calculus…
The objective of this paper is to establish the decomposition theorem for supermartingales under the $G$-framework. We first introduce a $g$-nonlinear expectation via a kind of $G$-BSDE and the associated supermartingales. We have shown…
In this paper, under some weaker conditions, we give three laws of large numbers under sublinear expectations (capacities), which extend Peng's law of large numbers under sublinear expectations in [8] and Chen's strong law of large numbers…
Proposed is a new formal approach for solution of extreme multi-criteria problems transforming them into single-criterion mathematical models, without any additional information. Transforming rules are based on comparison standards and…
In this paper, we study the integral representation of g-expectations with two kinds of terminal constraints, and obtain the corresponding necessary and sufficient conditions.
In this paper, the Neyman-Pearson lemma for general sublinear expectations is studied. We weaken the assumptions for sublinear expectations in [1] and give a completely new method to study this problem. Applying Mazur-Orlicz Theorem and the…
Comparative prime number theory is the study of the {\em{discrepancies}} of distributions when we compare the number of primes in different residue classes. This work presents a list of the problems being investigated in comparative prime…
We extend Berge's Maximum Theorem to allow for incomplete preferences. We first provide a simple version of the Maximum Theorem for convex feasible sets and a fixed preference. Then, we show that if, in addition to the traditional…
In finite problems comprising objects, situations, and an object- and situation-contingent payoff function, we study the comparative statics of the set of undominated objects, meaning those for which there exists no mixture over objects…
We attack the problem of getting a strict ranking (i.e. a ranking without equally ranked items) of $n$ items from a pairwise comparisons matrix. Basic structures are described, a first heuristical approach based on a condition, the…
In this paper, we obtain a new estimate for uniform integrability under sublinear expectations. Based on this, we establish the limit theorems under nonlinear expectations dominated by sublinear expectations through tightness, and the limit…
Young's inequality is extended to the context of absolutely continuous measures. Several applications are included.
In this paper we extend the definition of time conditional G-expectations $\mathbb{\hat{E}}_{t}[\cdot]$ to a larger domain on which the dynamical consistency still holds. In fact we can consistently define, by taking the limit, the time…
We prove that if $T$ is a complete theory with weak elimination of imaginaries, then there is an explicit bijection between strict independence relations for $T$ and strict independence relations for $T^{\text{eq}}$. We use this observation…
We describe a new framework of a sublinear expectation space and the related notions and results of distributions, independence. A new notion of G-distributions is introduced which generalizes our G-normal-distribution in the sense that…
The ``impossibility theorem'' -- which is considered foundational in algorithmic fairness literature -- asserts that there must be trade-offs between common notions of fairness and performance when fitting statistical models, except in two…