We study the asymptotic behavior of random time changes dynamical systems. As we propose three classes which exhibits different patterns decays. The subordination principle may be applied to It turns out that for special case stable subordinators explicit expressions are known and its derived. For more general calculations essentially complicated reduce our corresponding Cesaro limit.

We give a necessary and sufficient condition for extremality of a supermodular function based on its min-representation by means of (vertices of) the corresponding core polytope. The condition leads to solving a certain simple linear equation system determined by the combinatorial core structure. This result allows us to characterize indecomposability in the class of generalized permutohedra. W...

In this paper we study the complexity of the maximum constraint satisfaction problem (Max CSP) over an arbitrary finite domain. We describe a novel connection between this problem and the supermodular function maximization problem (which is dual to the submodular function minimization problem). Using this connection, we are able to identify large classes of efficiently solvable subproblems of M...

The class of supermodular functions on the power set of a non-empty nite set N forms a cone. It can be viewed as the direct sum of a linear subspace and of a cone of standardized supermodular functions which has nitely many extreme rays. Every extreme ray can be described by a standardized integer-valued set function. We analyse the situation in the case when N has ve elements (= variables). A ...

We introduce a class of discrete point processes that we call the Submodular Point Processes (SPPs). These processes are characterized via a submodular (or supermodular) function, and naturally model notions of information, coverage and diversity, as well as cooperation. Unlike Log-submodular and Log-supermodular distributions (Log-SPPs) such as determinantal point processes (DPPs), SPPs are th...

We study the approximation of the least core value and the least core of supermodular cost cooperative games. We provide a framework for approximation based on oracles that approximately determine maximally violated constraints. This framework yields a 3-approximation algorithm for computing the least core value of supermodular cost cooperative games, and a polynomial-time algorithm for computi...

Recently Yang and Qi (2013) stated an interesting theorem on the existence of complete lattice of equilibria in a particular class of large nonatomic supermodular games for general action and players spaces. Unfortunately, their result is incorrect. In this note, we detail the nature of the problem with the stated theorem, provide a counterexample, and then correct the result under additional a...

There are no general theoretical results on the stability of the Lindahl mechanism introduced by Chen (2002). We show that despite not …tting the requirements of the Milgrom and Roberts 1990 stability results for supermodular games, if the Chen mechanism induces a supermodular game, then the best reply map will be a contraction. This gives us a easy to identify su¢ cient condition for dynamic s...