In this paper we provide an axiomatic characterization of the equal loss choice function for multiattribute choice problem.

In this paper we provide a simple proof for the axiomatic characterization of the Kalai-Smorodinsky Solution.

In this paper we axiomatically characterize the family of lexicographic utilitarian collective utility functions. As a by-product we obtain the utilitarian collective utility function by imposing a shift anonymity condition. ...

In this paper, to begin with we present a generalization of the independence of irrelevant expansions assumption to the situation with an arbitrary yet finite number of players, and with the help of a comparatively simpler ...

In Kannai and Peleg(1984) the following problem was posed: Given a positive integer n , is it possible to define a positive integer valued function on all non-empty subsets of the first n positive integers, so that ...

In this paper we provide an axiomatic characterization of a choice function due to Cao (1981) multiattribute choice problems.

In axiomatic bargaining (choice theory), a choice function of some importance is the utilitarian choice function. Basically, this choice function selects the vector of utilities whose sum is greatest, among all utility ...

The general problem we are interested in this paper is of the following variety. We are given a finite universal set and a linear ordering on it. What is the minimal axiomatic characterization of a particular extension of ...

In this paper we consider choice problems which are bounded both above and below and provide a new axiomatic characterization of the equal loss choice function. We subsequently turn to a study of various properties implied ...

n this paper we characterise the Orlovsky solution and what we refer to as the family of threshold solutions. Our family of threshold solutions are somewhat larger than the family of solutions which select only those ...