Rawlsian Allocation In Queueing And Sequencing Problem. Reportar como inadecuado




Rawlsian Allocation In Queueing And Sequencing Problem. - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract

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.



Item Type: MPRA Paper -

Original Title: Rawlsian Allocation In Queueing And Sequencing Problem.-

English Title: Rawlsian Allocation In Queueing And Sequencing Problem.-

Language: English-

Keywords: Queueing problems, Sequencing problems, Strategyproofness, Rawlsian allocation.-

Subjects: C - Mathematical and Quantitative Methods > C7 - Game Theory and Bargaining Theory > C72 - Noncooperative GamesD - Microeconomics > D8 - Information, Knowledge, and Uncertainty > D82 - Asymmetric and Private Information ; Mechanism Design-





Autor: De, Parikshit

Fuente: https://mpra.ub.uni-muenchen.de/58744/







Documentos relacionados