This paper presents an analysis of the problem of aggregating preference orderings under subjective uncertainty. Individual preferences, or opinions, agree on the ranking of risky prospects, but are quite general because we do not specify the perception of ambiguity or the attitude towards it. A convexity axiom for the ex-ante preference characterizes a (collective) decision rule that can be in...

Later a bouquet of Krasnosel 'skii-type theorems was discovered; see [1,2, 3, 4,16,17]. Apart from the usual line segment visibility and starshapedness several other notions of starshaped set and visibility have been investigated in the past years: d-starshaped sets in metric and normed spaces [14,15,16,17], starshaped sets in graphs [14,171, staircase visibility [5,10,12], rectangular visibili...

convexity theory and duality theory are important issues in math- ematical programming. within the framework of credibility theory, this paper rst introduces the concept of convex fuzzy variables and some basic criteria. furthermore, a convexity theorem for fuzzy chance constrained programming is proved by adding some convexity conditions on the objective and constraint functions. finally,...

In this work we deal with the so-called path convexities, defined over special collections of paths. For example, the collection of the shortest paths in a graph is associated with the well-known geodesic convexity, while the collection of the induced paths is associated with the monophonic convexity ; and there are many other examples. Besides reviewing the path convexities in the literature, ...

We study the existence of Stackelberg equilibrium points on strategy sets which are geodesic convex in certain Riemannian manifolds by using metric projection arguments. The present results extend those obtained in Nagy [J. Global Optimization (2013)] in the Euclidean context.

Linear relation analysis (polyhedral analysis), devoted to discovering linear invariant relations among variables of a program, remains one of the most powerful abstract interpretations but is subject to convexity limitations. Absolute value enjoys piecewise linear expressiveness and thus natively fits to encode certain non-convex properties. Based on this insight, we propose to use linear abso...

Abstract This paper is devoted to state some fixed point results for multivalued mappings in modular vector spaces. For this purpose, we study the uniform noncompact convexity, a geometric property spaces which similar nearly convexity Banach setting. Using property, several new theorems nonexpansive

There exists a surface of a convex polyhedron P and a partition L of P into geodesic convex polygons such that there are no connected"edge"unfoldings of P without self-intersections (whose spanning tree is a subset of the edge skeleton of L).

It is shown that a subset of a uniformly convex normed space is nearly convex if and only if its closure is convex. Also, a normed space satisfying a mild completeness property is strictly convex if and only if every metrically convex subset is convex. 1 Classical and constructive mathematics The arguments in this paper conform to constructive mathematics in the sense of Errett Bishop. This mea...