Advanced Search
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. De, Parikshit, 2013. "Incentive and normative analysis on sequencing problem," MPRA Paper 55127, University Library of Munich, Germany.
  3. 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.
  4. 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.
  5. 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.
  6. 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.
  7. Moulin, Herve, 2005. "Split-Proof Probabilistic Scheduling," Working Papers 2004-06, Rice University, Department of Economics.
  8. AMBEC, Stefan & EHLERS, Lars, 2006. "Sharing a River among Satiable Countries," Cahiers de recherche 07-2006, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
  9. Moulin, Herve, 2004. "On Scheduling Fees to Prevent Merging, Splitting and Transferring of Jobs," Working Papers 2004-04, Rice University, Department of Economics.
  10. 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).
  11. Moulin, Herve, 2005. "Minimizing the Worst Slowdown: Off-Line and On-Line," Working Papers 2005-03, Rice University, Department of Economics.
  12. Fan Zhang & Pramode Verma, 2011. "Pricing multi-class network services using the Shapley Value," Netnomics, Springer, vol. 12(1), pages 61-75, April.
  13. 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.
  14. 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).
  15. 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.
  16. 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.
  17. RAMAEKERS, Eve & KAYI, Cagatay, 2008. "Characterizations of Pareto-efficient, fair, and strategy-proof allocation rules in queueing problems," CORE Discussion Papers 2008084, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  18. René van den Brink & Gerard van der Laan & Valeri Vasil'ev, 2003. "Harsanyi Solutions in Line-graph Games," Tinbergen Institute Discussion Papers 03-076/1, Tinbergen Institute.
  19. 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.
  20. Alex Gershkov & Paul Schweinzer, 2006. "When Queuening is Better than Push and Shove," Bonn Econ Discussion Papers bgse10_2006, University of Bonn, Germany.
  21. Youngsub Chun & Manipushpak Mitra & Suresh Mutuswami, 2013. "Reordering an existing queue," Discussion Papers in Economics 13/15, Department of Economics, University of Leicester.
  22. 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).
  23. 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.
  24. 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.
  25. 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.
  26. Brink, J.R. van den & Ruys, P.H.M., 2005. "Technological Change, Wages and Firm Size," Discussion Paper 2005-022, Tilburg University, Tilburg Law and Economic Center.
  27. Manipushpak Mitra & Suresh Mutuswami, 2006. "Group Strategyproofness in Queueing Models," Economics Discussion Papers 610, University of Essex, Department of Economics.
  28. Anirban Kar & Manipushpak Mitra & Suresh Mutuswami, 2005. "On the coincidence of the Prenucleolus and the Shapley Value," Economics Discussion Papers 599, University of Essex, Department of Economics.
  29. 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.
  30. William Thomson, 2007. "Children Crying at Birthday Parties. Why?," Economic Theory, Springer, vol. 31(3), pages 501-521, June.
  31. Chun, Youngsub, 2006. "A pessimistic approach to the queueing problem," Mathematical Social Sciences, Elsevier, vol. 51(2), pages 171-181, March.
  32. 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.
  33. 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).
  34. 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.
  35. René van den Brink, 2004. "Null or Zero Players: The Difference between the Shapley Value and the Egalitarian Solution," Tinbergen Institute Discussion Papers 04-127/1, Tinbergen Institute.
  36. repec:dgr:uvatin:0000038 is not listed on IDEAS
  37. 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.
  38. Rene van den Brink & Chris Dietz, 2012. "Games with a Local Permission Structure: Separation of Authority and Value Generation," Tinbergen Institute Discussion Papers 12-126/II, Tinbergen Institute.
  39. Chun, Youngsub & Mitra, Manipushpak, 2014. "Subgroup additivity in the queueing problem," European Journal of Operational Research, Elsevier, vol. 238(1), pages 281-289.
  40. Rene van den Brink & Pieter H.M. Ruys, 2005. "Positional Wages, Market Wages and Firm Size," Tinbergen Institute Discussion Papers 05-020/1, Tinbergen Institute.
  41. Arin, J. & Feltkamp, V., 2012. "Coalitional games: Monotonicity and core," European Journal of Operational Research, Elsevier, vol. 216(1), pages 208-213.
  42. 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.