k-Balanced games and capacities

In this paper, we present a generalization of the concept of balanced game for finite games. Balanced games are those having a nonempty core, and this core is usually considered as the solution of the game. Based on the concept of k-additivity, we define the so-called k-balanced games and the corresponding generalization of core, the k-additive core, whose elements are not directly imputations but k-additive games. We show that any game is k-balanced for a suitable choice of k, so that the corresponding k-additive core is not empty. For the games in the k-additive core, we propose a sharing procedure to get an imputation and a representative value for the expectations of the players based on the pessimistic criterion. Moreover, we look for necessary and sufficient conditions for a game to be k-balanced. For the general case, it is shown that any game is either balanced or 2-balanced. Finally, we treat the special case of capacities.     

On the stability of <Emphasis Type="Italic">θ</Emphasis>-derivations on <Emphasis Type="Italic">JB</Emphasis>*-triples

We introduce the concept of θ-derivations on JB*-triples and prove the Hyers–Ulam-Rassias stability of θ-derivations on JB*-triples. We deal with the Hyers-Ulam-Rassias stability that was first introduced by Th. M. Rassias in the paper “On the stability of the linear mapping in Banach spaces, Proc. Amer. Math. Soc. 72 (1978), 297–300”. The first author was supported by Korea Research Foundation Grant KRF-2005-070-C00009.     

E *-Stable Theories

S. Shelah proved that stability of a theory is equivalent to definability of every complete type of that theory. T. Mustafin introduced the concept of being T ^*-stable, generalizing the notion of being stable. However, T ^*-stability does not necessitate definability of types. The key result of the present article is proving the definability of types for E ^*-stable theories. This concept differs from that of being T ^*-stable by adding the condition of being continuous. As a consequence we arrive at the definability of types over any P-sets in P-stable theories, which previously was established by T. Nurmagambetov and B. Poizat for types over P-models.     

Isometric isomorphisms in proper <Emphasis Type="Italic">CQ</Emphasis>*-algebras

In this paper, we prove the Hyers-Ulam-Rassias stability of isometric homomorphisms in proper CQ＊-algebras for the following Cauchy-Jensen additive mapping： 2f[（x1＋x2）/2＋y]=f（x1）＋f（x2）＋2f（y） The concept of Hyers-Ulam-Rassias stability originated from the Th.M. Rassias＇ stability theorem that appeared in the paper： On the stability of the linear mapping in Banach spaces, Proc. Amer. Math. Soc., 72 （1978）, 297-300. This is applied to investigate isometric isomorphisms between proper CQ＊-algebras.     

Progressive and merging-proof taxation

We investigate the implications and logical relations between progressivity (a principle of distributive justice) and merging-proofness (a strategic principle) in taxation. By means of two characterization results, we show that these two principles are intimately related, despite their different nature. In particular, we show that, in the presence of continuity and consistency (a widely accepted framework for taxation) progressivity implies merging-proofness and that the converse implication holds if we add an additional strategic principle extending the scope of merging-proofness to a multilateral setting. By considering operators on the space of taxation rules, we also show that progressivity is slightly more robust than merging-proofness.     

On the practical value of the notion ofBN-stability

The oldest concept of unconditional stability of numerical integration methods for ordinary differential systems is that ofA-stability. This concept is related to linear systems having constant coefficients and has been introduced by Dahlquist in 1963. More recently, since another contribution of Dahlquist in 1975, there has been much interest in unconditional stability properties of numerical integration methods when applied to non-linear dissipative systems (G-stability,BN-stability,A-contractivity). Various classes of implicit Runge-Kutta methods have already been shown to beBN-stable. However, contrary to the property ofA-stability, when implementing such a method for practical use this unconditional stability property may be lost. The present note clarifies this for a class of diagonally implicit methods and shows at the same time that Rosenbrock's method is notBN-stable.     

Probabilistic Choice in Games: Properties of Rosenthal’s t-Solutions

The t-solutions introduced in R. W. Rosenthal (1989, Int J Game Theory 18:273–292) are quantal response equilibria based on the linear probability model. Choice probabilities in t-solutions are related to the determination of leveling taxes in taxation problems. The set of t-solutions coincides with the set of Nash equilibria of a game with quadratic control costs. Evaluating the set of t-solutions for increasing values of t yields that players become increasingly capable of iteratively eliminating never-best replies and eventually only play rationalizable actions with positive probability. These features are not shared by logit quantal response equilibria. Moreover, there exists a path of t-solutions linking uniform randomization to Nash equilibrium     

Stability Conditions of the MMAP [ K ]/ G [ K ]/1/ LCFS Preemptive Repeat Queue

In this paper, we study the stability conditions of the MMAP[K]/G[K]/1/LCFS preemptive repeat queue. We introduce an embedded Markov chain of matrix M/G/1 type with a tree structure and identify conditions for the Markov chain to be ergodic. First, we present three conventional methods for the stability problem of the queueing system of interest. These methods are either computationally demanding or do not provide accurate information for system stability. Then we introduce a novel approach that develops two linear programs whose solutions provide sufficient conditions for stability or instability of the queueing system. The new approach is numerically efficient. The advantages and disadvantages of the methods introduced in this paper are analyzed both theoretically and numerically.     

A-Statistical extension of the Korovkin type approximation theorem

In this paper, using the concept ofA-statistical convergence which is a regular (non-matrix) summability method, we obtain a general Korovkin type approximation theorem which concerns the problem of approximating a functionf by means of a sequenceL _n f of positive linear operators.     

Price Expectations and Cobwebs Under Uncertainty

Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept) to the service facilities. The median solution concept is primarily concerned with the spatial efficiency while the center concept is focused on the spatial equity. The k-centrum model unifies both the concepts by minimization of the sum of the k largest distances. In this paper we investigate a solution concept of the conditional median which is a generalization of the k-centrum concept taking into account the portion of demand related to the largest distances. Namely, for a specified portion (quantile) of demand we take into account the entire group of the corresponding largest distances and we minimize their average. It is shown that such an objective, similar to the standard minimax, may be modeled with a number of simple linear inequalities. Equitable properties of the solution concept are examined.     

Connections between stability and asymptotic stability of nonlinear switched systems

Here are considered nonlinear switched systems in which the switching occurs among a class of subsystems that are characterized by input–output properties stated in terms of L_p spaces of signals. The relationships between the L_p stability of each subsystem and the internal stability of the switched system are studied. In particular, conditions on the dwell time of the switching signals that guarantee the asymptotic stability of the overall system are provided. The connections among these conditions and the L_p input–output properties of the subsystems are investigated.     

<Emphasis Type="Italic">I</Emphasis> and <Emphasis Type="Italic">I</Emphasis>*-convergence of double sequences

The idea of I-convergence was introduced by Kostyrko et al (2001) and also independently by Nuray and Ruckle (2000) (who called it generalized statistical convergence) as a generalization of statistical convergence (Fast (1951), Schoenberg(1959)). For the last few years, study of these convergences of sequences has become one of the most active areas of research in classical Analysis. In 2003 Muresaleen and Edely introduced the concept of statistical convergence of double sequences. In this paper we consider the notions of I and I*-convergence of double sequences in real line as well as in general metric spaces. We primarily study the inter-relationship between these two types of convergence and then investigate the category and porosity position of bounded I and I*-convergent double sequences. This work is funded by Council of Scientific and Industrial Research, HRDG, India.     

Optimality conditions and duality for nondifferentiable multiobjective fractional programming with generalized convexity

In this paper, we consider nondifferentiable multiobjective fractional programming problems. A concept of generalized convexity, which is called (C,α,ρ,d)-convexity, is first discussed. Based on this generalized convexity, we obtain efficiency conditions for multiobjective fractional programming (MFP). Furthermore, we establish duality results for three types of dual problems of (MFP) and present the corresponding duality theorems.     

Detecting all evolutionarily stable strategies

In evolutionary game theory, the central solution concept is the evolutionarily stable state, which also can be interpreted as an evolutionarily stable population strategy (ESS). As such, this notion is a refinement of the Nash equilibrium concept in that it requires an additional stability property. In the present paper, an algorithm for detectingall ESSs of a given evolutionary game consisting of pairwise conflicts is presented which both is efficient and complete, since it involves a procedure avoiding the search for unstable equilibria to a considerable extent, and also has a finite, exact routine to check evolutionary stability of a given equilibrium. The article also contains the generalization of these results to the playing-the-field setting, where the payoff is nonlinear.     

Universal Jensen＇s Equations in Banach Modules over a C^＊-Algebra and Its Unitary Group

In this paper, we prove the generalized Hyers-Ulam-Rassias stability of universal Jensen‘s equations in Banach modules over a unital C^*-algebra. It is applied to show the stability of universal Jensen‘s equations in a Hilbert module over a unital C^*-algebra. Moreover, we prove the stability of linear operators in a Hilbert module over a unital C^*-algebra.     

<Emphasis Type="Italic">ε</Emphasis>-Optimality and <Emphasis Type="Italic">ε</Emphasis>-Lagrangian Duality for a Nonconvex Programming Problem with an Infinite Number of Constraints

In this paper, ε-optimality conditions are given for a nonconvex programming problem which has an infinite number of constraints. The objective function and the constraint functions are supposed to be locally Lipschitz on a Banach space. In a first part, we introduce the concept of regular ε-solution and propose a generalization of the Karush-Kuhn-Tucker conditions. These conditions are up to ε and are obtained by weakening the classical complementarity conditions. Furthermore, they are satisfied without assuming any constraint qualification. Then, we prove that these conditions are also sufficient for ε-optimality when the constraints are convex and the objective function is ε-semiconvex. In a second part, we define quasisaddlepoints associated with an ε-Lagrangian functional and we investigate their relationships with the generalized KKT conditions. In particular, we formulate a Wolfe-type dual problem which allows us to present ε-duality theorems and relationships between the KKT conditions and regular ε-solutions for the dual. Finally, we apply these results to two important infinite programming problems: the cone-constrained convex problem and the semidefinite programming problem.     

Approximate Isomorphisms in <Emphasis Type="Italic">C</Emphasis><Superscript>*</Superscript>-Algebras

This paper is a survey on the Hyers–Ulam–Rassias stability of the following Cauchy–Jensen functional equation in C ^*-algebras:

On vector variational inequalities

In this paper, we study vector variational inequalities. The concept of weaklyC-pseudomonotone operator is introduced. By employing the Fan lemma, we establish several existence results. The new results extend and unify existence results of vector variational inequalities for monotone operators under a Banach space setting. In particular, existence results for the generalized vector complementarity problem with weaklyC-pseudomonotone operators in Banach space are obtained.This research was partially supported by the National Science Council of the Republic of China under Contract NSC 84-2121-M-110-008.     

On some approximately balanced combinatorial cooperative games

A model of taxation for cooperativen-person games is introduced where proper coalitions Are taxed proportionally to their value. Games with non-empty core under taxation at rate-balanced. Sharp bounds on in matching games (not necessarily bipartite) graphs are estabLished. Upper and lower bounds on the smallest in bin packing games are derived and euclidean random TSP games are seen to be, with high probability,-balanced for0.06.     

The expected value models on Sugeno measure space

Uncertain programming is a theoretical tool to handle optimization problems under uncertain environment. The research reported so far is mainly concerned with probability, possibility, or credibility measure spaces. Up to now, uncertain programming realized in Sugeno measure space has not been investigated. The first type of uncertain programming considered in this study and referred to as an expected value model optimizes a given expected objective function subject to some expected constraints. We start with a concept of the Sugeno measure space. We revisit some main properties of the Sugeno measure and elaborate on the g_λ random variable and its characterization. Furthermore, the laws of the large numbers are discussed based on this space. In the sequel we introduce a Sugeno expected value model (SEVM). In order to construct an approximate solution to the complex SEVM, the ideas of a Sugeno random number generation and a Sugeno simulation are presented along with a hybrid approach.