On incentive compatibility and budget balancedness in public decision making

Citations

Cited by:

1. Mitra, Manipushpak, 2005. "Incomplete information and multiple machine queueing problems," European Journal of Operational Research, Elsevier, vol. 165(1), pages 251-266, August.
   • Mitra, Manipushpak, 2001. "Incomplete Information and Multiple Machine Queueing Problems," Bonn Econ Discussion Papers 19/2001, University of Bonn, Bonn Graduate School of Economics (BGSE).
2. 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.
3. Yengin, Duygu & Chun, Youngsub, 2020. "No-envy, solidarity, and strategy-proofness in the queueing problem," Journal of Mathematical Economics, Elsevier, vol. 88(C), pages 87-97.
4. Hervé Crès & Hervé Moulin, 2001. "Scheduling with Opting Out: Improving upon Random Priority," Operations Research, INFORMS, vol. 49(4), pages 565-577, August.
   • Hervé Crès & Hervé Moulin, 1998. "Scheduling with Opting Out: Improving Upon Random Priority," Working Papers hal-00601584, HAL.
   • Hervé Crès & Hervé Moulin, 2001. "Scheduling with Opting Out: Improving Upon Random Priority," SciencePo Working papers Main hal-03598174, HAL.
   • Hervé Crès & Hervé Moulin, 2001. "Scheduling with Opting Out: Improving Upon Random Priority," Post-Print hal-03598174, HAL.
   • Moulin, Herve & Cres, Moulin, 2000. "Scheduling with Opting Out: Improving upon Random Priority," Working Papers 2000-03, Rice University, Department of Economics.
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. Van Essen, Matt & Wooders, John, 2021. "Allocating positions fairly: Auctions and Shapley value," Journal of Economic Theory, Elsevier, vol. 196(C).
7. Carbajal, Juan Carlos, 2010. "On the uniqueness of Groves mechanisms and the payoff equivalence principle," Games and Economic Behavior, Elsevier, vol. 68(2), pages 763-772, March.
8. Sambuddha Ghosh & Yan Long & Manipushpak Mitra, 2021. "Prior-free online mechanisms for queueing with arrivals," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 72(2), pages 671-700, September.
9. Banerjee, Sreoshi, 2023. "Stability and fairness in sequencing games: optimistic approach and pessimistic scenarios," MPRA Paper 118680, University Library of Munich, Germany.
10. Maniquet, Francois, 2003. "A characterization of the Shapley value in queueing problems," Journal of Economic Theory, Elsevier, vol. 109(1), pages 90-103, March.
    • Maniquet, F., 2000. "A Characterization of the Shapley Value in Queueing Problems," Papers 222, Notre-Dame de la Paix, Sciences Economiques et Sociales.
    • MANIQUET, François, 2003. "A characterization of the Shapley value in queueing problems," LIDAM Reprints CORE 1662, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
11. 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.
12. 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.
13. Birgit Heydenreich & Rudolf Müller & Marc Uetz & Rakesh V. Vohra, 2009. "Characterization of Revenue Equivalence," Econometrica, Econometric Society, vol. 77(1), pages 307-316, January.
    • First:Birgit Heydenreich & Rudolf Muller & Marc Uetz & Rakesh Vohra, 2007. "Characterization of Revenue Equivalence," Discussion Papers 1448, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    • Heydenreich, B. & Müller, R.J. & Uetz, M.J. & Vohra, R., 2008. "Characterization of revenue equivalence," Research Memorandum 001, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    • Heydenreich, B. & Müller, R.J. & Uetz, M.J. & Vohra, R., 2007. "Characterization of revenue equivalence," Research Memorandum 017, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
14. Youngsub Chun, 2006. "No-envy in queueing problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 29(1), pages 151-162, September.
15. 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).
16. 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.
17. Rahul Deb & Debasis Mishra, 2014. "Implementation With Contingent Contracts," Econometrica, Econometric Society, vol. 82, pages 2371-2393, November.
    • Rahul Deb & Debasis Mishra, 2014. "Implementation with contingent contracts," Discussion Papers 14-01, Indian Statistical Institute, Delhi.
18. Carbajal, Juan Carlos & Müller, Rudolf, 2015. "Implementability under monotonic transformations in differences," Journal of Economic Theory, Elsevier, vol. 160(C), pages 114-131.
    • Juan Carlos Carbajal & Rudolf Müller, 2015. "Implementability under Monotonic Transformations in Differences," Working Papers 37, Peruvian Economic Association.
19. 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.
20. Moulin, Hervé, 2008. "Proportional scheduling, split-proofness, and merge-proofness," Games and Economic Behavior, Elsevier, vol. 63(2), pages 567-587, July.
21. Long, Yan & Mishra, Debasis & Sharma, Tridib, 2017. "Balanced ranking mechanisms," Games and Economic Behavior, Elsevier, vol. 105(C), pages 9-39.
    • Debasis Mishra & Tridib Sharma, 2016. "Balanced ranking mechanisms," Discussion Papers 16-04, Indian Statistical Institute, Delhi.
22. Chun, Youngsub & Yengin, Duygu, 2017. "Welfare lower bounds and strategy-proofness in the queueing problem," Games and Economic Behavior, Elsevier, vol. 102(C), pages 462-476.
    • Youngsub Chun & Duygu Yengin, 2014. "Welfare Lower Bounds and Strategyproofness in the Queueing Problem," Working Paper Series no93, Institute of Economic Research, Seoul National University.
    • Duygu Yengin & Youngsub Chun, 2015. "Welfare Lower Bounds and Strategyproofness in the Queueing Problem," School of Economics and Public Policy Working Papers 2015-11, University of Adelaide, School of Economics and Public Policy.
23. 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.
24. Chun, Youngsub & Mitra, Manipushpak & Mutuswami, Suresh, 2019. "A characterization of the symmetrically balanced VCG rule in the queueing problem," Games and Economic Behavior, Elsevier, vol. 118(C), pages 486-490.
25. Chun, Youngsub, 2006. "A pessimistic approach to the queueing problem," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 171-181, March.
26. Manipushpak Mitra, 2001. "Mechanism design in queueing problems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 17(2), pages 277-305.
    • Manipushpak Mitra, 2000. "Mechanism Design in Queueing Problems," Econometric Society World Congress 2000 Contributed Papers 1301, Econometric Society.
27. 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.
28. 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.
29. 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.
30. Kayi, C. & Ramaekers, E., 2008. "An impossibility in sequencing problems," Research Memorandum 040, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
31. Murali Agastya & Oleksii Birulin, 2023. "Optimal Task Scheduling under Adverse Selection and Hidden Actions," American Economic Journal: Microeconomics, American Economic Association, vol. 15(2), pages 660-698, May.
32. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2017. "Reordering an existing queue," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(1), pages 65-87, June.
    • Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Reordering an existing queue," Discussion Papers in Economics 13/15, Division of Economics, School of Business, University of Leicester.
33. 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.
34. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
35. 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).
36. Moulin, Herve, 2005. "Minimizing the Worst Slowdown: Off-Line and On-Line," Working Papers 2005-03, Rice University, Department of Economics.
37. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
38. Nakamura, Yuta, 2019. "Strategy-proof characterizations of the pivotal mechanisms on restricted domains," Mathematical Social Sciences, Elsevier, vol. 101(C), pages 77-87.
39. Yuta Nakamura, 2020. "The uniqueness of the pivotal mechanisms without strategy-proofness," Review of Economic Design, Springer;Society for Economic Design, vol. 24(3), pages 171-186, December.
40. Daske, Thomas, 2019. "Efficient Incentives in Social Networks: "Gamification" and the Coase Theorem," EconStor Preprints 193148, ZBW - Leibniz Information Centre for Economics.
    • Daske, Thomas, 2020. "Efficient Incentives in Social Networks: Gamification and the Coase Theorem," EconStor Preprints 213805, ZBW - Leibniz Information Centre for Economics.
    • Daske, Thomas, 2020. "Efficient Incentives in Social Networks: Gamification and the Coase Theorem," EconStor Preprints 222527, ZBW - Leibniz Information Centre for Economics, revised 2020.
41. 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.
42. William Thomson, 2007. "Children Crying at Birthday Parties. Why?," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 31(3), pages 501-521, June.
    • William Thomson, 2006. "Children crying at birthday parties. Why? Fairness and incentives for cake division problems," RCER Working Papers 526, University of Rochester - Center for Economic Research (RCER).
43. De, Parikshit & Mitra, Manipushpak, 2019. "Balanced implementability of sequencing rules," Games and Economic Behavior, Elsevier, vol. 118(C), pages 342-353.
44. De, Parikshit, 2014. "Rawlsian Allocation In Queueing And Sequencing Problem," MPRA Paper 58744, University Library of Munich, Germany.
45. Hervé Moulin, 2007. "Minimizing the Worst Slowdown: Offline, Online," Operations Research, INFORMS, vol. 55(5), pages 876-889, October.
46. Yi, Jianxin & Li, Yong, 2016. "A general impossibility theorem and its application to individual rights," Mathematical Social Sciences, Elsevier, vol. 81(C), pages 79-86.
47. Banerjee, Sreoshi & De, Parikshit & Mitra, Manipushpak, 2020. "A welfarist approach to sequencing problems with incentives," MPRA Paper 107188, University Library of Munich, Germany.
48. Hamers, Herbert & Klijn, Flip & Suijs, Jeroen, 1999. "On the balancedness of multiple machine sequencing games," European Journal of Operational Research, Elsevier, vol. 119(3), pages 678-691, December.
49. Banerjee, Sreoshi, 2024. "On identifying efficient, fair and stable allocations in "generalized" sequencing games," MPRA Paper 120188, University Library of Munich, Germany.
50. 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.
51. You, Jung S., 2015. "Optimal VCG mechanisms to assign multiple bads," Games and Economic Behavior, Elsevier, vol. 92(C), pages 166-190.
52. De, Parikshit, 2013. "Incentive and normative analysis on sequencing problem," MPRA Paper 55127, University Library of Munich, Germany.