IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!)

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. Kar, Anirban & Mitra, Manipushpak & Mutuswami, Suresh, 2005. "On the coincidence of the Prenucleolus and the Shapley Value," Economics Discussion Papers 8892, University of Essex, Department of Economics.
  2. van den Brink, J.R. & Herings, P.J.J. & van der Laan, G. & Talman, A.J.J., 2013. "The average tree permission value for games with a permission tree," Research Memorandum 001, Maastricht University, Graduate School of Business and Economics (GSBE).
  3. 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).
  4. René Brink & Ilya Katsev & Gerard Laan, 2011. "Axiomatizations of two types of Shapley values for games on union closed systems," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 47(1), pages 175-188, May.
  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.
  6. Casajus, André & Huettner, Frank, 2014. "Weakly monotonic solutions for cooperative games," Journal of Economic Theory, Elsevier, vol. 154(C), pages 162-172.
  7. 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.
  8. 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.
  9. Hougaard, J. & Moreno-Ternero, J. & Tvede, M. & Osterdal, L., 2015. "Sharing the proceeds from a hierarchical venture," CORE Discussion Papers 2015031, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  10. repec:esx:essedp:610 is not listed on IDEAS
  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.
  12. MISHRA, Debasis & RANGARAJAN, Bharath, 2005. "Cost sharing in a job scheduling problem," CORE Discussion Papers 2005053, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  13. AMBEC, Stefan & EHLERS, Lars, 2006. "Sharing a River among Satiable Countries," Cahiers de recherche 07-2006, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
  14. René Brink & René Levínský & Miroslav Zelený, 2015. "On proper Shapley values for monotone TU-games," International Journal of Game Theory, Springer;Game Theory Society, vol. 44(2), pages 449-471, May.
  15. Sylvain Ferrières, 2016. "Smoothness, nullified equal loss property and equal division values," Working Papers 2016-01, CRESE.
  16. 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.
  17. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
  18. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
  19. Sylvain Béal & Éric Rémila & Philippe Solal, 2011. "On the Number of Blocks Required to Access the Core," Post-Print halshs-00674426, HAL.
  20. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Reordering an existing queue," Discussion Papers in Economics 13/15, Department of Economics, University of Leicester.
  21. 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.
  22. Moulin, Herve, 2005. "Minimizing the Worst Slowdown: Off-Line and On-Line," Working Papers 2005-03, Rice University, Department of Economics.
  23. René Brink & Gerard Laan & Valeri Vasil’ev, 2007. "Component efficient solutions in line-graph games with applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 33(2), pages 349-364, November.
  24. 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).
  25. De, Parikshit, 2013. "Incentive and normative analysis on sequencing problem," MPRA Paper 55127, University Library of Munich, Germany.
  26. Béal, Sylvain & Ferrières, Sylvain & Rémila, Eric & Solal, Philippe, 2016. "Axiomatic characterizations under players nullification," Mathematical Social Sciences, Elsevier, vol. 80(C), pages 47-57.
  27. Mitra, Manipushpak & Mutuswami, Sureh, 2006. "Group Strategyproofness in Queueing Models," Economics Discussion Papers 8901, University of Essex, Department of Economics.
  28. 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.
  29. René Brink & Gerard Laan & Valeri Vasil’ev, 2014. "Constrained core solutions for totally positive games with ordered players," International Journal of Game Theory, Springer;Game Theory Society, vol. 43(2), pages 351-368, May.
  30. Reijnierse, Hans & Borm, Peter & Quant, Marieke & Meertens, Marc, 2010. "Processing games with restricted capacities," European Journal of Operational Research, Elsevier, vol. 202(3), pages 773-780, May.
  31. Andreas Darmann & Christian Klamler, 2014. "Knapsack cost sharing," Review of Economic Design, Springer;Society for Economic Design, vol. 18(3), pages 219-241, September.
  32. 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.
  33. 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;Game Theory Society, vol. 43(4), pages 821-843, November.
  34. Mitra, Manipushpak & De, Parikshit, 2015. "Incentives and justice for sequencing problems," MPRA Paper 65447, University Library of Munich, Germany.
  35. Mikel Álvarez-Mozos & René van den Brink & Gerard van der Laan & Oriol Tejada, 2015. "From Hierarchies to Levels: New Solutions for Games," Tinbergen Institute Discussion Papers 15-072/II, Tinbergen Institute.
  36. Duygu Yengin & Youngsub Chun, 2015. "Welfare Lower Bounds and Strategyproofness in the Queueing Problem," School of Economics Working Papers 2015-11, University of Adelaide, School of Economics.
  37. Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
  38. 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.
  39. Yuan Ju, 2013. "Efficiency and compromise: a bid-offer–counteroffer mechanism with two players," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(2), pages 501-520, May.
  40. 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.
  41. Demuynck, T. & De Rock, B. & Ginsburgh, V., 2015. "The transfer paradox in welfare space," CORE Discussion Papers 2015039, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  42. Duygu Yengin, 2010. "Characterizing the Shapley Value in Fixed-Route Traveling Salesman Problems with Appointments," School of Economics Working Papers 2010-32, University of Adelaide, School of Economics.
  43. 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.
  44. Dehez, P., 2015. "On Harsanyi dividends and asymmetrid values," CORE Discussion Papers 2015040, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  45. Fan Zhang & Pramode Verma, 2011. "Pricing multi-class network services using the Shapley Value," Netnomics, Springer, vol. 12(1), pages 61-75, April.
  46. Arin, J. & Feltkamp, V., 2012. "Coalitional games: Monotonicity and core," European Journal of Operational Research, Elsevier, vol. 216(1), pages 208-213.
  47. René Brink & Yukihiko Funaki & Yuan Ju, 2013. "Reconciling marginalism with egalitarianism: consistency, monotonicity, and implementation of egalitarian Shapley values," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 40(3), pages 693-714, March.
  48. Garcia-Sanz, M.D. & Fernandez, F.R. & Fiestras-Janeiro, M.G. & Garcia-Jurado, I. & Puerto, J., 2008. "Cooperation in Markovian queueing models," European Journal of Operational Research, Elsevier, vol. 188(2), pages 485-495, July.
  49. René van den Brink & Gerard van der Laan & Valeri Vasil'ev, 0000. "The Restricted Core for Totally Positive Games with Ordered Players," Tinbergen Institute Discussion Papers 09-038/1, Tinbergen Institute.
  50. 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.
  51. Chun, Youngsub, 2006. "A pessimistic approach to the queueing problem," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 171-181, March.
  52. 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).
  53. Mikel Álvarez-Mozos & Rene van den Brink & Gerard van der Laan & Oriol Tejada, 2015. "From Hierarchies to Levels: New Solutions for Games with Hierarchical Structure," CER-ETH Economics working paper series 15/215, CER-ETH - Center of Economic Research (CER-ETH) at ETH Zurich.
  54. Chun, Youngsub & Mitra, Manipushpak & Mutuswami, Suresh, 2014. "Characterizations of pivotal mechanisms in the queueing problem," Mathematical Social Sciences, Elsevier, vol. 72(C), pages 62-66.
This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.