We present the revealed preference conditions that characterize the data sets that are consistent with the maximization of a weakly separable utility function. We show that verifying these revealed preference conditions is np-hard. We also present an integer programming approach, which is...

We present necessary and sufficient revealed preference conditions to verify whether a finite data set on nonlinear budget sets is consistent with the maximization of a quasi-concave utility function. When budget sets are finite unions of polyhedral convex sets, these conditions require...

We consider games with incomplete information à la Harsanyi, where the payoff of a player depends on an unknown state of nature as well as on the profile of chosen actions. As opposed to the standard model, playersʼ preferences over state-contingent utility vectors are represented by arbitrary...

In this paper, we investigate abstract convexity of non-positive increasing and radiant (IR) functions over a topological vector space. We characterize the essential results of abstract convexity such as support set, subdifferential and polarity of these functions. We also give some...

In this paper, we first obtain some properties of topical (increasing and plus-homogeneous) functions in the framework of abstract convexity. Next, we use the Toland–Singer formula to characterize the dual problem for the difference of two topical functions. Finally, we present necessary and...

An open question in the study of quasiconvex function is the characterization of the class of functions which are sum of quasiconvex functions. In this paper we restrict our attention to quasiconvex radiant functions, i.e. those whose level sets are radiant as well as convex and deal with the...