Continuous Event Graphs (CEGs), a subclass of Continuous Petri Nets, are defined as the limiting cases of timed event graphs and Timed Event Multigraphs. A set of dioid algebraic linear equations will be inferred as a novel method of analyzing a special class of CEG, if treated the cumulated token consumed by transitions as state-variables, endowed the monotone nondecreasing functions pointwise...

In this paper, we proved some coincidence point results for f-nondecreasing self-mapping satisfying certain rational type contractions in the context of a metric space endowed with partial order. Moreover, consequences main result are given by involving integral space. Some numerical examples illustrated to support our results. As an application, have discussed existence unique solution equation.

Lemma A1: If a contract {wt} is self-enforcing, then there is another self-enforcing contract {w′ t} such that: (i) w′ t is nondecreasing in t, (ii) the no-shirking conditions, Ut − U1 ≥ ĉ for all t ≥ 2, do not bind for any t ≥ 2, (iii) firms’expected (discounted) profits are the same under two contracts, V1 = V ′ 1 . Proof. The proof is by construction. We show it in several steps. Step (1) (c...

The use of supervised learning techniques for fitting weights and/or generator functions of weighted quasi-arithmetic means – a special class of idempotent and nondecreasing aggregation functions – to empirical data has already been considered in a number of papers. Nevertheless, there are still some important issues that have not been discussed in the literature yet. In the second part of this...

The traditional zero-one principle for sorting networks states that ”if a network with n input lines sorts all 2n binary sequences into nondecreasing order, then it will sort any arbitrary sequence of n numbers into nondecreasing order.” We generalize this to the situation when a network sorts almost all binary sequences and relate it to the behavior of the sorting network on arbitrary inputs. ...

We show that a real z is polynomial time random if and only if each nondecreasing polynomial time computable function is differentiable at z. This establishes an analog in feasible analysis of a recent result of Brattka, Miller and Nies, who characterized computable randomness in terms of differentiability of nondecreasing computable functions. Further, we show that a Martin-Löf random real z i...

In this paper, we prove that the first eigenvalues of −∆+ cR (c ≥ 1 4 ) are nondecreasing under the Ricci flow. We also prove the monotonicity under the normalized Ricci flow for the cases c = 1/4 and r ≤ 0. 1. First eigenvalue of −∆+ cR Let M be a closed Riemannian manifold, and (M,g(t)) be a smooth solution to the Ricci flow equation ∂ ∂t gij = −2Rij on 0 ≤ t < T . In [Cao07], we prove that a...

We consider a multilateral sequential bargaining model in which the players may differ in their probability of being selected as the proposer and the rate at which they discount future payoffs. For games in which agreement requires less than unanimous consent, we characterize the set of stationary subgame perfect equilibrium payoffs. With this characterization, we establish the uniqueness of th...

Call S complete if Σ(S) contains all sufficiently large integers. It has been known for some time (see [B]) that if gcd(a, b) = 1 then the (nondecreasing) sequence formed from the values ab with s0 ≤ s, t0 ≤ t ≤ f(s0, t0) is complete, where s0 and t0 are arbitrary, and f(s0, t0) is sufficiently large. In this note we consider the analogous question for sequences formed from pure powers of integ...