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...

The paper generalizes Kuhn's Theorem to extensive form games in which players condition their play on the realization of ambiguous randomization devices and use a maxmin decision rule to evaluate the consequences of their decisions. It proves that ambiguous behavioral and ambiguous mixed...