Cognitive dissonance or cognitive consistency theory, as we understand it, does not presume irrational behavior although it is inconsistent with normative rationality. Previous discussions have overlooked that cognitive dissonance implied dynamic undertainty. Once this dimension of choice is...

We prove an integral representation theorem for functionals fulfilling some continuity conditions. These functionals satisfy a weaker condition than additivity, namely additive comonotonicity and do not need to be monotonic.

One may reason before making a decision on perceiving potential objections to expected utility-preference. Cognitive consistency is attained by making full use of available information, i.e. consistent preference and reasons. I show that coincidence between the rational choice and the normative...

We shape a formal framework for distinguishing the behaviour of constructive and non-constructive polynomial time approximation algorithms for NP optimization problems. We introduce a new class, called SubNPO, that includes NPO and also some other problems used in recent works.

In this paper, we propose two efficient algorithms in order to approximately solve the Knapsack Sharing Problem (KSP). In KSP, we have a knapsack of capicity c and a set of n objects, where each object j, j=1,...,n, is associated with a profit pj and a weight wj. The set of objects is divided...

Kimball [1990] developps a theory of prudence isomorphic to Pratt [1964] and Arrow [1965] theory of risk aversion. Nevertheless, if the Arrow-Pratt risk aversion index determines behavior in risk, it is not always the case for prudence. Moreover, concept of prudence and precautionary behavior...

We analyze the approximation behaviour of some of the best-known polynomial time approximation algorithms for bin-packing under an approximation criterion, called differential ratio. This measure has originally been introduced by Ausiello, D'Atri and Protasi and more recently revisited, in a...