We study claims problems in which a certain amount of indivisible units (of an homogeneous good) has to be distributed among a group of agents, when this amount is not enough to fully satisfy agents' demands. We are interested in finding solutions satisfying robustness and fairness properties. To do that, we define the M-down methods, which are the unique robust (composition down and consistency) and fair (balancedness or conditional full compensation ) rules. Besides, we also establish the relationships between these M-down methods and the constrained equal awards rule.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) in its series CORE Discussion Papers with number
2006066.
Find related papers by JEL classification: D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
Cited by: (explanations, Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.)