In this paper, a pair of Wolfe type higher-order nondifferentiable symmetric dual programs over arbitrary cones has been studied and then well-suited duality relations have been established considering K-F convexity assumptions. An example which satisfies the weak duality relation has also been...

We use the theory of abstract convexity to study adverse-selection principal-agent problems and two-sided matching problems, departing from much of the literature by not requiring quasilinear utility. We formulate and characterize a basic underlying implementation duality. We show how this...

Charnes et al. (1982, 1983) introduced a multiplicative model for efficiency measurement under Data Envelopment Analysis (DEA) framework. Later, Coelli and Peyrach (2009) presented the Multiplicative Directional Distance Function which was recovered by Mehdiloozad et al. (2014) to draw the...

We use the theory of abstract convexity to study adverse-selection principal-agent problems and two-sided matching problems, departing from much of the literature by not requiring quasilinear utility. We formulate and characterize a basic underlying implementation duality. We show how this...