TY - JOUR

T1 - Nonsymmetric equal sacrifice solutions for claim problem

AU - Naumova, N. I.

PY - 2002/12/1

Y1 - 2002/12/1

N2 - A claim (allocation) problem is the problem of distributing a given amount of a divisible resource among agents with unequal claims on the resource. The main result of the paper is the following representation of a strictly monotonic, consistent, path independent, and individually unbounded solution of the claim problem. There exists a family of strictly increasing continuous utility functions of agents such that all agents have equal differences between values of their utility functions at the solution point and at the claim point. These solutions of the claim problem are called equal sacrifice solutions with respect to the family of utility functions. Young [Journal of Economic Theory 44 (1988) 321] obtained a similar representation under an additional anonymity condition. Due to this result, we get the solution of goal programming problems with convex feasible sets satisfying natural axioms. The solution of the goal programming problem is the point minimizing the measure of proximity to the goal point. Here the measure of proximity is defined as the sum of antiderivatives of differences between utility functions. Under additional positive homogeneity condition, we get maximal weighted entropy solution.

AB - A claim (allocation) problem is the problem of distributing a given amount of a divisible resource among agents with unequal claims on the resource. The main result of the paper is the following representation of a strictly monotonic, consistent, path independent, and individually unbounded solution of the claim problem. There exists a family of strictly increasing continuous utility functions of agents such that all agents have equal differences between values of their utility functions at the solution point and at the claim point. These solutions of the claim problem are called equal sacrifice solutions with respect to the family of utility functions. Young [Journal of Economic Theory 44 (1988) 321] obtained a similar representation under an additional anonymity condition. Due to this result, we get the solution of goal programming problems with convex feasible sets satisfying natural axioms. The solution of the goal programming problem is the point minimizing the measure of proximity to the goal point. Here the measure of proximity is defined as the sum of antiderivatives of differences between utility functions. Under additional positive homogeneity condition, we get maximal weighted entropy solution.

KW - Allocation rule

KW - Claim problem

KW - Entropy

KW - Equal sacrifice

KW - Goal programming

UR - http://www.scopus.com/inward/record.url?scp=0344556149&partnerID=8YFLogxK

U2 - 10.1016/S0165-4896(01)00086-5

DO - 10.1016/S0165-4896(01)00086-5

M3 - Article

AN - SCOPUS:0344556149

VL - 43

SP - 1

EP - 18

JO - Mathematical Social Sciences

JF - Mathematical Social Sciences

SN - 0165-4896

IS - 1

ER -