Munich Personal RePEc Archive

Rawlsian allocation in queueing and sequencing problem.

De, Parikshit (2014): Rawlsian allocation in queueing and sequencing problem.

This is the latest version of this item.

[thumbnail of MPRA_paper_58744.pdf]

Download (291kB) | Preview


In this paper we analyze the implication of a particular kind of allocation rule called Rawlsian allocation rule on queueing and sequencing problems. We find that in case of queueing problems, Efficient allocation rules are Rawlsian but the converse is not true. For a particular class of Rawlsian allocation rule we characterize the unique class of transfer rule that ensures non-manipulability. Also in case of a situation where there is private information in multiple dimension, we find that a the particular kind of Rawlsian allocation rule equipped with a suitable transfer rule works as a panacea.

Available Versions of this Item

Atom RSS 1.0 RSS 2.0

Contact us: mpra@ub.uni-muenchen.de

This repository has been built using EPrints software.

MPRA is a RePEc service hosted by Logo of the University Library LMU Munich.