Carpathian Journal of Mathematics, Vol. 31, No. 3 (2015), pp. 365-371 (7 pages) Based on the concepts and problems introduced in [Rus, I. A., The theory of a metrical fixed point theorem: theoretical ...

Convex geometry and combinatorial optimisation form a vibrant nexus of research that bridges theoretical mathematics with practical algorithm design. The study of convex sets and their structural ...

where \(\mathsf{G}(\cdot)\) is some convex operator and \(\mathcal{F}\) is as set of feasible input distributions. Examples of such an optimization problem include finding capacity in information ...

We consider economies with preferences drawn from a very general class of strongly convex preferences, closely related to the class of convex (but intransitive and incomplete) preferences for which ...