On subadditive functions and ψ-additive mappings

In [4], assuming among others subadditivity and submultiplicavity of a function ψ: [0, ∞)→[0, ∞), the authors proved a Hyers-Ulam type stability theorem for “ψ-additive” mappings of a normed space into a normed space. In this note we show that the assumed conditions of the function ψ imply that ψ=0 and, consequently, every “ψ-additive” mapping must be additive     

Generalized Hyers-Ulam stability for general additive functional equations in quasi-β-normed spaces

In 1940 S.M. Ulam proposed the famous Ulam stability problem. In 1941 D.H. Hyers solved the well-known Ulam stability problem for additive mappings subject to the Hyers condition on approximately additive mappings. The first author of this paper investigated the Hyers-Ulam stability of Cauchy and Jensen type additive mappings. In this paper we generalize results obtained for Jensen type mappings and establish new theorems about the Hyers-Ulam stability for general additive functional equations in quasi-β-normed spaces.     

EXISTENCE PROBLEMS OF ADDITIVE SELECTION MAPS FOR ANOTHER TYPE SUBADDITIVE SET-VALUED MAP

In this paper,we consider the following subadditive set-valued map F:X → P 0 (Y):F r ∑ i=1 x i + s ∑ j=1 x r+ j rF r ∑ i=1 x i r + sF s ∑ j=1 x r+ j s, x i ∈ X,i=1,2,,r + s,where r and s are two natural numbers.And we discuss the existence and unique problem of additive selection maps for the above set-valued map.     

On the extension of subadditive measures in lattice ordered groups

A lattice ordered group valued subadditive measure is extended from an algebra of subsets of a set to a σ-algebra.     

Ergodicity of Jackson-type queueing networks

This paper gives a pathwise construction of Jackson-type queueing networks allowing the derivation of stability and convergence theorems under general probabilistic assumptions on the driving sequences; namely, it is only assumed that the input process, the service sequences and the routing mechanism are jointly stationary and ergodic in a sense that is made precise in the paper. The main tools for these results are the subadditive ergodic theorem, which is used to derive a strong law of large numbers, and basic theorems on monotone stochastic recursive sequences. The techniques which are proposed here apply to other and more general classes of discrete event systems, like Petri nets or GSMPs. The paper also provides new results on the Jackson-type networks with i.i.d. driving sequences which were studied in the past.The work of this author was supported in part by a grant from the European Commission DG XIII, under the BRA Qmips contract.The work of this author was supported by a sabbatical grant from INRIA Sophia Antipolis.     

The lyapunov spectrum and stable manifolds for stochastic linear delay equations

A class of linear stochastic retarded functional differential equations is considered. These equations have diffusion coefficients that do not look into the past. It is shown that the trajectories of such equations form a continuous linear cocycle on the underlying state space. At times greater than the delay the cocycle is almost surely compact. Consequently, using an infinite-dimensional Oseledec multiplicative ergodic theorem of Ruelle, the existence of a countable non-random Lyapunov spectrum is proved. In the hyperbolic case it is shown that the state space admits an almost sure saddle-point splitting which is cocycle-invariant and corresponds to an exponential dichotomy for the stochastic flow     

The representations of two types of functionals on L∞(Ω, ?) and L∞(Ω, ?, ?)

This article gives the representations of two types of real functionals on L ^∞(Ω, Ƒ) or L ^∞(Ω, Ƒ, ℙ) in terms of Choquet integrals. These functionals are comonotonically subadditive and comonotonically convex, respectively.     

On some discrete inequalities in two independent variables

In this paper we establish some new nonlinear difference inequalities. We also present an application of one inequality to certain nonlinear sum-difference equation.     

Staircase transportation problems with superadditive rewards and cumulative capacities

A cumulative-capacitated transportation problem is studied. The supply nodes and demand nodes are each chains. Shipments from a supply node to a demand node are possible only if the pair lies in a sublattice, or equivalently, in a staircase disjoint union of rectangles, of the product of the two chains. There are (lattice) superadditive upper bounds on the cumulative flows in all leading subrectangles of each rectangle. It is shown that there is a greatest cumulative flow formed by the natural generalization of the South-West Corner Rule that respects cumulative-flow capacities; it has maximum reward when the rewards are (lattice) superadditive; it is integer if the supplies, demands and capacities are integer; and it can be calculated myopically in linear time. The result is specialized to earlier work of Hoeffding (1940), Fréchet (1951), Lorentz (1953), Hoffman (1963) and Barnes and Hoffman (1985). Applications are given to extreme constrained bivariate distributions, optimal distribution with limited one-way product substitution and, generalizing results of Derman and Klein (1958), optimal sales with age-dependent rewards and capacities.To our friend, Philip Wolfe, with admiration and affection, on the occasion of his 65th birthday.Research was supported respectively by the IBM T.J. Watson and IBM Almaden Research Centers and is a minor revision of the IBM Research Report [6].