IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Login

Citations for "A Characterization of the Shapley Value in Queueing Problems"

by Maniquet, F.

For a complete description of this item, click here. For a RSS feed for citations of this item, click here.
as in new window

  1. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Egalitarian Equivalence And Strategyproofness In The Queueing Problem," Discussion Papers in Economics 13/16, Department of Economics, University of Leicester.
  2. René Brink & Youngsub Chun, 2012. "Balanced consistency and balanced cost reduction for sequencing problems," Social Choice and Welfare, Springer, vol. 38(3), pages 519-529, March.
  3. Ambec, S. & Ehlers, L., 2006. "Sharing a river among satiable countries," Working Papers 200605, Grenoble Applied Economics Laboratory (GAEL).
  4. Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
  5. Chun, Youngsub, 2006. "A pessimistic approach to the queueing problem," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 171-181, March.
  6. repec:dgr:uvatin:2012126 is not listed on IDEAS
  7. van den Brink, J.R. & Ruys, P.H.M., 2005. "Technological Change, Wages and Firm Size," Discussion Paper 2005-022, Tilburg University, Tilburg Law and Economic Center.
  8. Debasis Mishra & Bharath Rangarajan, 2007. "Cost sharing in a job scheduling problem," Social Choice and Welfare, Springer, vol. 29(3), pages 369-382, October.
  9. Manipushpak Mitra & Suresh Mutuswami, 2006. "Group Strategyproofness in Queueing Models," Economics Discussion Papers 610, University of Essex, Department of Economics.
  10. Thomson, William, 2011. "Chapter Twenty-One - Fair Allocation Rules," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 2, chapter 21, pages 393-506 Elsevier.
  11. René Brink & Ilya Katsev & Gerard Laan, 2011. "Axiomatizations of two types of Shapley values for games on union closed systems," Economic Theory, Springer, vol. 47(1), pages 175-188, May.
  12. repec:dgr:uvatin:20090038 is not listed on IDEAS
  13. Kar, Anirban & Mitra, Manipushpak & Mutuswami, Suresh, 2009. "On the coincidence of the prenucleolus and the Shapley value," Mathematical Social Sciences, Elsevier, vol. 57(1), pages 16-25, January.
  14. 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.
  15. 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 and Osaka School of International Public Policy (OSIPP).
  16. Casajus, André & Huettner, Frank, 2014. "Weakly monotonic solutions for cooperative games," Journal of Economic Theory, Elsevier, vol. 154(C), pages 162-172.
  17. repec:dgr:uvatin:20030076 is not listed on IDEAS
  18. 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.
  19. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
  20. Conan Mukherjee, 2013. "Weak group strategy-proof and queue-efficient mechanisms for the queueing problem with multiple machines," International Journal of Game Theory, Springer, vol. 42(1), pages 131-163, February.
  21. Alex Gershkov & Paul Schweinzer, 2006. "When Queuening is Better than Push and Shove," Bonn Econ Discussion Papers bgse10_2006, University of Bonn, Germany.
  22. Moulin, Herve, 2005. "Minimizing the Worst Slowdown: Off-Line and On-Line," Working Papers 2005-03, Rice University, Department of Economics.
  23. 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).
  24. Brink J.R. van den & Talman A.J.J. & Herings P.J.J. & Laan G. van der, 2013. "The average tree permission value for games with a permission tree," Research Memorandum 001, Maastricht University, Graduate School of Business and Economics (GSBE).
  25. repec:dgr:uvatin:20120126 is not listed on IDEAS
  26. Andreas Darmann & Christian Klamler, 2014. "Knapsack cost sharing," Review of Economic Design, Springer, vol. 18(3), pages 219-241, September.
  27. De, Parikshit, 2013. "Incentive and normative analysis on sequencing problem," MPRA Paper 55127, University Library of Munich, Germany.
  28. William Thomson, 2007. "Children Crying at Birthday Parties. Why?," Economic Theory, Springer, vol. 31(3), pages 501-521, June.
  29. Arin, J. & Feltkamp, V., 2012. "Coalitional games: Monotonicity and core," European Journal of Operational Research, Elsevier, vol. 216(1), pages 208-213.
  30. René Brink & Yukihiko Funaki & Yuan Ju, 2013. "Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values," Social Choice and Welfare, Springer, vol. 40(3), pages 693-714, March.
  31. Duygu Yengin, 2012. "Characterizing the Shapley value in fixed-route traveling salesman problems with appointments," International Journal of Game Theory, Springer, vol. 41(2), pages 271-299, May.
  32. Julio González-Díaz & Estela Sánchez-Rodríguez, 2014. "Understanding the coincidence of allocation rules: symmetry and orthogonality in TU-games," International Journal of Game Theory, Springer, vol. 43(4), pages 821-843, November.
  33. repec:dgr:uvatin:0000038 is not listed on IDEAS
  34. Fan Zhang & Pramode Verma, 2011. "Pricing multi-class network services using the Shapley Value," Netnomics, Springer, vol. 12(1), pages 61-75, April.
  35. repec:dgr:uvatin:20040127 is not listed on IDEAS
  36. René Brink & Gerard Laan & Valeri Vasil’ev, 2007. "Component efficient solutions in line-graph games with applications," Economic Theory, Springer, vol. 33(2), pages 349-364, November.
  37. repec:dgr:uvatin:20140016 is not listed on IDEAS
  38. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
  39. repec:dgr:uvatin:20050020 is not listed on IDEAS
  40. Yuan Ju, 2013. "Efficiency and compromise: a bid-offer–counteroffer mechanism with two players," International Journal of Game Theory, Springer, vol. 42(2), pages 501-520, May.
  41. René Brink & Gerard Laan & Valeri Vasil’ev, 2014. "Constrained core solutions for totally positive games with ordered players," International Journal of Game Theory, Springer, vol. 43(2), pages 351-368, May.
  42. repec:dgr:uvatin:2009038 is not listed on IDEAS
  43. Kayi Çağatay & Ramaekers Eve, 2008. "An Impossibility in Sequencing Problems," Research Memorandum 040, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  44. Kazuhiko Hashimoto & Hiroki Saitoh, 2012. "Strategy-proof and anonymous rule in queueing problems: a relationship between equity and efficiency," Social Choice and Welfare, Springer, vol. 38(3), pages 473-480, March.
  45. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Reordering an existing queue," Discussion Papers in Economics 13/15, Department of Economics, University of Leicester.
  46. repec:dgr:kubtil:2005022 is not listed on IDEAS
  47. René Brink & Chris Dietz, 2014. "Games with a local permission structure: separation of authority and value generation," Theory and Decision, Springer, vol. 76(3), pages 343-361, March.
  48. Sakai, Toyotaka, 2007. "Fairness and implementability in allocation of indivisible objects with monetary compensations," Journal of Mathematical Economics, Elsevier, vol. 43(5), pages 549-563, June.
  49. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2010. "On the number of blocks required to access the core," MPRA Paper 26578, University Library of Munich, Germany.
This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.