De, Parikshit (2014): Rawlsian allocation in queueing and sequencing problem.
This is the latest version of this item.
Preview |
PDF
MPRA_paper_58744.pdf Download (291kB) | Preview |
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 Games D - Microeconomics > D8 - Information, Knowledge, and Uncertainty > D82 - Asymmetric and Private Information ; Mechanism Design |
Item ID: | 65444 |
Depositing User: | PARIKSHIT DE |
Date Deposited: | 06 Jul 2015 10:59 |
Last Modified: | 06 Oct 2019 04:30 |
References: | Mishra, D., and Mitra,M. (2010). Cycle Monotonicity in Scheduling Models. Econophysics and Economics of Games, Social Choices and Quantitative Techniques. Springer Milan, 2010. 10-16. Mitra, M., (2001). Mechanism design in queueing problems. Economic Theory 17, 277-305. Mitra, M., 2002. Achieving the first best in sequencing problems. Review of Economic Design 7, 75-91. De, P. (2013). Incentive and normative analysis on sequencing problem. Mitra, M., and Mutuswami, S. (2011). Group strategy-proofness in queueing models. Games and Economic Behavior, 72(1), 242-254. Serizawa, S. (2006). Pairwise strategy-proofness and self-enforcing manipulation. Social Choice and Welfare, 26(2), 305-331. Suijs, J., 1996. On incentive compatibility and budget balancedness in public decision making. Economic Design 2, 193-209. Holmstrom, B., (1979). Groves schemes on restricted domains. Econometrica 47, 1137-1144. Clarke, E. H., (1971). Multi-part pricing of public goods. Public Choice 11, 17-33. Groves, T., (1973). Incentives in teams. Econometrica 41, 617-631. Maniquet, F. (2003). A characterization of the Shapley value in queueing problems. Journal of Economic Theory, 109(1), 90-103. Vickrey, W., (1961). Counterspeculation, auctions and competitive sealed tenders. Journal of Finance 16, 8-37. |
URI: | https://mpra.ub.uni-muenchen.de/id/eprint/65444 |
Available Versions of this Item
-
Rawlsian Allocation In Queueing And Sequencing Problem. (deposited 23 Sep 2014 14:50)
- Rawlsian allocation in queueing and sequencing problem. (deposited 06 Jul 2015 10:59) [Currently Displayed]