Related papers: Almost Strong Properness
We investigate the partial orderings of the form (P(X),\subset), where X is a countable binary relational structure and P(X) the set of the domains of its isomorphic substructures and show that if the components of X are maximally…
Most fairness assumptions used for verifying liveness properties are criticised for being too strong or unrealistic. On the other hand, justness, arguably the minimal fairness assumption required for the verification of liveness properties,…
We prove a rigidity theorem that shows that, under many circumstances, quasi-isometric embeddings of equal rank, higher rank symmetric spaces are close to isometric embeddings. We also produce some surprising examples of quasi-isometric…
We study resource allocation in two-sided markets from a fundamental perspective and introduce a general modeling and algorithmic framework to effectively incorporate the complex and multidimensional aspects of fairness. Our main technical…
This paper proposes a general framework for inference on three types of almost dominances: almost Lorenz dominance, almost inverse stochastic dominance, and almost stochastic dominance. We first generalize almost Lorenz dominance to almost…
We give a collection of explicit sufficient conditions for the true martingale property of a wide class of exponentials of semimartingales. We express the conditions in terms of semimartingale characteristics. This turns out to be very…
The extension of classical imperative programs with real-valued random variables and random branching gives rise to probabilistic programs. The termination problem is one of the most fundamental liveness properties for such programs. The…
We prove a variation of Easton's lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle $\textsf{IGMP}$, $\textsf{GMP}$ together with $2^\omega \le \omega_2$ is consistent with the existence of an…
In this paper, we give sufficient conditions for the equivalence between semigroup strong Feller property and resolvent strong Feller property.
This paper has two parts. In the first part we recall the important role that weak proregularity of an ideal in a commutative ring has in derived completion and in adic flatness. We also introduce the new concepts of idealistic and…
Dependency pairs are one of the most powerful techniques to analyze termination of term rewrite systems (TRSs) automatically. We adapt the dependency pair framework to the probabilistic setting in order to prove almost-sure innermost…
The notion of almost periodicity nontrivially generalizes the notion of periodicity. Strongly almost periodic sequences (=uniformly recurrent infinite words) first appeared in the field of symbolic dynamics, but then turned out to be…
Over the function field of a complex algebraic curve, strong approximation off a non-empty finite set of places holds for the complement of a codimension $2$ closed subset in a homogeneous space under a semisimple algebraic group, and for…
This paper compares two different frameworks recently introduced in the literature for measuring risk in a multi-period setting. The first corresponds to applying a single coherent risk measure to the cumulative future costs, while the…
We present a formal measure of argument strength, which combines the ideas that conclusions of strong arguments are (i) highly probable and (ii) their uncertainty is relatively precise. Likewise, arguments are weak when their conclusion…
We study the classic problem of fairly allocating a set of indivisible goods among a group of agents, and focus on the notion of approximate proportionality known as PROPm. Prior work showed that there exists an allocation that satisfies…
We introduce a definition of pressure for almost-additive sequences of continuous functions defined over (non-compact) countable Markov shifts. The variational principle is proved. Under certain assumptions we prove the existence of Gibbs…
We investigate a slight weakening of the classical property of strong approximation, which we call almost strong approximation, for connected reductive algebraic groups over global fields with respect to special sets of valuations. While…
In this paper, we study how to fairly allocate m indivisible chores to n (asymmetric) agents. We consider (weighted) proportionality up to any item (PROPX) and show that a (weighted) PROPX allocation always exists and can be computed…
We present three natural combinatorial properties for class forcing notions, which imply the forcing theorem to hold. We then show that all known sufficent conditions for the forcing theorem (except for the forcing theorem itself),…