Achieving the first best in sequencing problems

Citations

Cited by:

1. Kazuhiko Hashimoto & Hiroki Saitoh, 2012. "Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 473-480, March.
2. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
3. Hain, Roland & Mitra, Manipushpak, 2004. "Simple sequencing problems with interdependent costs," Games and Economic Behavior, Elsevier, vol. 48(2), pages 271-291, August.
   • Mitra, Manipushpak & Hain, Roland, 2001. "Simple Sequencing Problems with Interdependent Costs," Bonn Econ Discussion Papers 20/2001, University of Bonn, Bonn Graduate School of Economics (BGSE).
4. Conan Mukherjee, 2013. "Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(1), pages 131-163, February.
5. Ju, Yuan & Chun, Youngsub & van den Brink, René, 2014. "Auctioning and selling positions: A non-cooperative approach to queueing conflicts," Journal of Economic Theory, Elsevier, vol. 153(C), pages 33-45.
   • Yuan Ju & Youngsub Chun & Rene van den Brink, 2014. "Auctioning and Selling Positions: a noncooperative approach to queueing conflicts," Working Paper Series no91, Institute of Economic Research, Seoul National University.
   • Rene van den Brink & Youngsub Chun & Yuan Ju, 2014. "Auctioning and Selling Positions: A Non-cooperative Approach to Queuing Conflicts," Tinbergen Institute Discussion Papers 14-016/II, Tinbergen Institute.
6. Alex Gershkov & Paul Schweinzer, 2010. "When queueing is better than push and shove," International Journal of Game Theory, Springer;Game Theory Society, vol. 39(3), pages 409-430, July.
   • Gerskov, Alex & Schweinzer, Paul, 2006. "When Queueing is Better than Push and Shove," Bonn Econ Discussion Papers 10/2006, University of Bonn, Bonn Graduate School of Economics (BGSE).
   • Gershkov, Alex & Schweinzer, Paul, 2006. "When queueing is better than push and shove," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 144, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
7. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
8. Banerjee, Sreoshi, 2023. "Stability and fairness in sequencing games: optimistic approach and pessimistic scenarios," MPRA Paper 118680, University Library of Munich, Germany.
9. Kazuhiko Hashimoto & Hiroki Saitoh, 2008. "Strategy-Proof and Anonymous Rule in Queueing Problems: A Relationship between Equity and Efficiency," Discussion Papers in Economics and Business 08-17, Osaka University, Graduate School of Economics.
10. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2019. "Recent developments in the queueing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(1), pages 1-23, April.
11. KayI, Çagatay & Ramaekers, Eve, 2010. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," Games and Economic Behavior, Elsevier, vol. 68(1), pages 220-232, January.
    • RAMAEKERS, Eve & KAYI, Cagatay, 2008. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," LIDAM Discussion Papers CORE 2008084, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • KAYI, Cagatay & RAMAEKERS, Eve, 2010. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," LIDAM Reprints CORE 2179, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
12. Bloch, Francis, 2017. "Second-best mechanisms in queuing problems without transfers:The role of random priorities," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 73-79.
13. Parikshit De & Manipushpak Mitra, 2017. "Incentives and justice for sequencing problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 64(2), pages 239-264, August.
    • Mitra, Manipushpak & De, Parikshit, 2015. "Incentives and justice for sequencing problems," MPRA Paper 65447, University Library of Munich, Germany.
14. Debasis Mishra & Bharath Rangarajan, 2007. "Cost sharing in a job scheduling problem," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(3), pages 369-382, October.
    • MISHRA, Debasis & RANGARAJAN, Bharath, 2005. "Cost sharing in a job scheduling problem," LIDAM Discussion Papers CORE 2005053, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
15. Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
16. De, Parikshit & Mitra, Manipushpak, 2019. "Balanced implementability of sequencing rules," Games and Economic Behavior, Elsevier, vol. 118(C), pages 342-353.
17. Mitra, Manipushpak & Mutuswami, Suresh, 2011. "Group strategyproofness in queueing models," Games and Economic Behavior, Elsevier, vol. 72(1), pages 242-254, May.
    • Mitra, Manipushpak & Mutuswami, Sureh, 2006. "Group Strategyproofness in Queueing Models," Economics Discussion Papers 8901, University of Essex, Department of Economics.
18. De, Parikshit, 2014. "Rawlsian Allocation In Queueing And Sequencing Problem," MPRA Paper 58744, University Library of Munich, Germany.
19. Moulin, Hervé, 2008. "Proportional scheduling, split-proofness, and merge-proofness," Games and Economic Behavior, Elsevier, vol. 63(2), pages 567-587, July.
20. Youngsub Chun, 2011. "Consistency and monotonicity in sequencing problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(1), pages 29-41, February.
21. Hervé Moulin, 2007. "On Scheduling Fees to Prevent Merging, Splitting, and Transferring of Jobs," Mathematics of Operations Research, INFORMS, vol. 32(2), pages 266-283, May.
    • Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
22. Banerjee, Sreoshi & De, Parikshit & Mitra, Manipushpak, 2020. "A welfarist approach to sequencing problems with incentives," MPRA Paper 107188, University Library of Munich, Germany.
23. Chun, Youngsub, 2006. "A pessimistic approach to the queueing problem," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 171-181, March.
24. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2023. "Balanced VCG mechanisms for sequencing problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 60(1), pages 35-46, January.
25. Dominik Kress & Sebastian Meiswinkel & Erwin Pesch, 2018. "Mechanism design for machine scheduling problems: classification and literature overview," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(3), pages 583-611, July.
26. Banerjee, Sreoshi, 2024. "On identifying efficient, fair and stable allocations in "generalized" sequencing games," MPRA Paper 120188, University Library of Munich, Germany.
27. René Brink & Youngsub Chun, 2012. "Balanced consistency and balanced cost reduction for sequencing problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 38(3), pages 519-529, March.
    • Rene van den Brink & Youngsub Chun, 2010. "Balanced Consistency and Balanced Cost Reduction for Sequencing Problems," Tinbergen Institute Discussion Papers 10-035/1, Tinbergen Institute.
28. De, Parikshit, 2013. "Incentive and normative analysis on sequencing problem," MPRA Paper 55127, University Library of Munich, Germany.