The core is a central solution concept in cooperative game theory, and therefore it is important to know under what conditions the core of a game is guaranteed to be non-empty. Two notions that prove to be very useful in this context are Linear Programming (LP) duality and convexity. In this work, we apply these tools to identify games with overlapping coalitions (OCF games) that admit stable o...

Let (Ω,Σ) be a measurable space and let X be a Banach space. Throughout this paper G will be a countably additive vector measure G : Σ → X. Consider the space L1(G) of (classes of real) G-integrable functions, following the definition of Bartle, Dunford and Schwartz [1] and Lewis [9]. The properties of this space have been studied by Kluvánek and Knowles [7], Okada [10] and Curbera [2]. In the ...

A corollary of a celebrated theorem of Minty is that the subdifferential graph of a closed convex function on Rn has uniform local dimension n. In contrast, there exist nonconvex closed functions whose subdifferentials have large graphs. We consider how far Minty’s corollary extends to functions that are nonconvex but semi-algebraic. © 2011 Elsevier Ltd. All rights reserved.

By the properties of Schur-convex function, Schur geometrically convex function and Schur harmonically convex function, Schur-convexity, Schur geometric and Schur harmonic convexities of the dual form for a class of symmetric functions are simply proved. As an application, several inequalities are obtained, some of which extend the known ones. Mathematics subject classification (2010): 26D15, 0...

A kind of generalized convex set, called as local star-shaped E-invex set with respect to η, is presented, and some of its important characterizations are derived. Based on this concept, a new class of functions, named as semilocal E-preinvex functions, which is a generalization of semi-Epreinvex functions and semilocal E-convex functions, is introduced. Simultaneously, some of its basic proper...

‎Complex-valued harmonic functions that are univalent and‎ ‎sense-preserving in the open unit disk $U$ can be written as form‎ ‎$f =h+bar{g}$‎, ‎where $h$ and $g$ are analytic in $U$‎. ‎In this paper‎, ‎we introduce the class $S_H^1(beta)$‎, ‎where $1<betaleq 2$‎, ‎and‎ ‎consisting of harmonic univalent function $f = h+bar{g}$‎, ‎where $h$ and $g$ are in the form‎ ‎$h(z) = z+sumlimits_{n=2}^inf...

We present a new constraint qualification which guarantees strong duality between a cone-constrained convex optimization problem and its Fenchel-Lagrange dual. This result is applied to a convex optimization problem having, for a given nonempty convex cone K , as objective function a K-convex function postcomposed with a K-increasing convex function. For this so-called composed convex optimizat...

Abstract. In this paper we derive by means of the duality theory necessary and sufficient optimality conditions for convex optimization problems having as objective function the composition of a convex function and a linear continuous mapping defined on a separated locally convex space with values in an finitedimensional space. We use the general results for deriving optimality conditions for t...

Given x0, a point of a convex subset C of an Euclidean space, the two following statements are proven to be equivalent: (i) any convex function f : C → R is upper semi-continuous at x0, and (ii) C is polyhedral at x0. In the particular setting of closed convex mappings and Fσ domains, we prove that any closed convex function f : C → R is continuous at x0 if and only if C is polyhedral at x0. Th...

A convex repeated game is a two players game that is performed in a sequence of consecutive rounds. On round t of the repeated game, the first player chooses a vector wt from a convex set A. Next, the second player responds with a convex function gt : A → R. Finally, the first player suffers an instantaneous loss gt(wt). We study the game from the viewpoint of the first player. In offline conve...