An introduction to allocation rules

An Introduction to Allocation Rules

Volumn , Issue , 2009, Pages 1-154

  Hougaard, Jens Leth ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79751534458     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-01828-2     Document Type: Book

References (138)

1. Aadland D, Kolpin V (1998) Shared irrigation costs: an empirical and axiomatic analysis. Math Soc Sci 35:203-218.
2. Brams SJ, Taylor AD (1996) Fair division: from cake-cutting to dispute resolution. Cambridge University Press, Cambridge.
3. Dopuch N (1981) Some perspectives on cost allocation. In: Moriarity S (ed) Joint cost allocations. University of Oklahoma Press, Norman, OK.
4. Foley D (1967) Resource allocation and the public sector. Yale Econ Essays 7:45-98.
5. Harsanyi JC (1975) Nonlinear social welfare functions. Theory Decis 6:311-332.
6. Kaplan RS, Bruns W (1987) Accounting and management: a field study perspective. Harvard Business School Press, Boston, MA.
7. Moulin H (1988) Axioms of cooperative decision making. Cambridge University Press, Cambridge.
8. Osborne MJ, Rubinstein A (1990) Bargaining and markets. Academic, New York.
9. Ransmeier JS (1942) The Tennessee Valley Authority: a case study in the economics of multiple purpose stream planning. Vanderbilt University Press, Nashville, TN.
10. Rawls J (1974) Some reasons for the maximin criterion. Am Econ Rev 64:141-146.
11. Roemer JE (1996) Theories of distributive justice. Harvard University Press, Cambridge, MA.
12. Shank JK, Govindarajan V (1993) Strategic cost management. Free Press, New York.
13. Shubik M (1962), Incentives, decentralized control, the assignment of joint costs and internal pricing. Manage Sci 8:325-343.
14. Thomas AL (1969) The allocation problem in financial accounting. Stud Account Res 3. American Accounting Association.
15. Thomas AL (1974) The allocation problem: part two. Stud Account Res 9. American Accounting Association.
16. Thomson W (2008) Fair allocation rules. In: Arrow K, Sen A, Suzumura K (eds) Handbook of social choice and welfare. North-Holland, Amsterdam, (forthcoming).
17. Tinbergen J (1953) Redeljke Inkomensverdeling. N.V. DeGulden, Haarlem.
18. Young HP (1994) Equity. Princeton University Press, Princeton, NJ.
19. Aadland D, Kolpin V (1998) Shared irrigation costs: an empirical and axiomatic analysis, Math Soc Sci 35:203-218.
20. Aumann R, Maschler M (1985) Game theoretic analysis of a bankruptcy problem from the Talmud. J Econ Theory 36:195-213.
21. Banker R (1981) Equity considerations in traditional full-cost allocation practices: an axiomatic perspective. In: Moriarty S (ed) Joint Cost Allocation. University of Oklahoma, Norman.
22. Chun Y (1988) The proportional solution for rights problems. Math Soc Sci 15: 231-246.
23. Chun Y (1999) Equivalence of axioms for bankruptcy problems. Int J Game Theory 28:511-520.
24. De Frutos MA (1998) Decreasing serial cost sharing under economies of scale. J Econ Theory 79:245-275.
25. De Frutos MA (1999) Coalitional manipulations in a bankruptcy problem. Rev Econ Des 4:255-272.
26. Herzog I, Shenker S, Estrin D (1997) Sharing multicast costs. In: McKnight, Bailey (eds) Internet economics. MIT, Cambridge, MA.
27. Hougaard JL, Thorlund-Petersen L (2000) The stand-alone test and decreasing serial cost sharing. Econ Theory 16:355-362.
28. Hougaard JL, Thorlund-Petersen L (2001) Mixed serial cost sharing. Math Soc Sci 41:51-68.
29. Hougaard JL, Thorlund-Petersen L (2002) Bankruptcy rules, inequality and uncertainty, Working Paper 01-04. Department of Operations Management, Copenhagen Business School.
30. Hougaard JL, Østerdal LP (2005) Inequality preserving rationing. Econ Lett 87:355-360.
31. Hougaard JL, Østerdal LP (2009) Decreasing serial cost sharing: an axiomatic characterization, Int J Game Theory, (forthcoming).
32. Ju G-B (2003) Manipulation via merging and splitting in claims problems. Rev Econ Des 8:205-215.
33. Koster M (2009) Cost sharing. In: Meyers R (ed) Encyclopedia of complexity and systems science. Springer, Berlin.
34. Marshall A, Olkin I (1979) Inequalities: theory of majorization and its application. Academic, New York.
35. Moulin H (1987) Equal or proportional division of a surplus and other methods. Int J Game Theory 16:161-186.
36. Moulin H (1996) Cost sharing under increasing returns: a comparison of simple mechanisms. Games Econ Behav 13:225-251.
37. Moulin H (2000) Priority rules and other asymmetric rationing rules. Econometrica 68:643-684.
38. Moulin H (2002) Axiomatic cost and surplus sharing. In: Arrow, Sen, Suzumura (eds) Handbook of social choice and welfare, chap.6. Elsevier, Amsterdam.
39. Moulin H, Shenker S (1992) Serial cost sharing. Econometrica 60:1009-1037.
40. Moulin H, Shenker S (1994) Average cost pricing versus serial cost sharing: an axiomatic comparison. J Econ Theory 64:178-201.
41. Moyes P (1989) Some classes of functions that preserve the inequality and welfare orderings of income distributions. J Econ Theory 49:347-359.
42. Moyes P (1994) Inequality reducing and inequality preserving transformations of incomes: symmetric and individualistic transformations. J Econ Theory 63: 271-298.
43. O'Neill B (1982) A problem of rights arbitration from the Talmud. Math Soc Sci 2:345-371.
44. Shenker S (1995) Making greed work in networks: a game theoretic analysis of gateway service disciplines. IEEE/ACM Trans Netw 3:819-831.
45. Shubik M (1962) Incentives, decentralized control, the assignment of joint costs and internal pricing, Manage Sci 8:325-343.
46. Thomson W (2003) Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey. Math Soc Sci 45:249-297.
47. Thomson W (2006) A Characterization of a family of rules for the adjudication of conflicting claims, Working Paper no. 530. Rochester Center for Economic Research.
48. Thon D, Thorlund-Petersen L (1986) Sums of increasing convex and increasing concave functions. Oper Res Lett 5:313-316.
49. Watts A (1996) On the uniqueness of equilibrium in Cournot oligopoly and other games. Games Econ Behav 13:269-285.
50. Young HP (1987) On dividing an amount according to individual claims or liabilities. Math Oper Res 12:398-414.
51. Young HP (1988) Distributive justice in taxation. J Econ Theory 44:312-335.
52. Arin J, Kuipers J, Vermeulen D (2003) Some characterizations of egalitarian solutions on classes of TU-games. Math Soc Sci 46:327-345.
53. Aumann R, Maschler M (1985) Game theoretic analysis of a bankruptcy problem from the Talmud. J Econ Theory 36:195-213.
54. Bjondal E, Hamers H, Koster M (2004) Cost allocation in a bank ATM network. Math Methods Oper Res 59:405-418.
55. Bondareva ON (1963) Certain applications of the method of linear programming to the theory of cooperative games. Problemy Kibernitiki 10:119-139.
56. Charnes A, Granot D (1973) Prior solutions: extensions of convex nucleolus solutions to chance-constrained games. In: Proceedings of the Computer Science and Statistics Seventh Symposium at Iowa State University, 323-332.
57. Curiel I (1997) Cooperative game theory and applications. Kluwer, Dordrecht.
58. Curiel I, Maschler M, Tijs SH (1987) Bankruptcy games. Z Oper Res 31:A143-A159.
59. Dutta B (1990) The egalitarian solution and reduced game properties in convex games. Int J Game Theory 19:153-169.
60. Dutta B, Ray D (1989) A concept of egalitarianism under participation constraints. Econometrica 57:615-635.
61. Hart S, Mas-Colell A (1989) Potential, value, and consistency. Econometrica 57:589-614.
62. Hokari T (2000) The nucleolus is not aggregate monotonic on the class of convex games. Int J Game Theory 29:133-137.
63. Hougaard JL, Østerdal LP (2006) Monotonicity of social welfare optima. Games Econ Behav (to appear).
64. Hougaard JL, Peleg B, Thorlund-Petersen L (2001) On the set of Lorenz-maximal imputations in the core of a balanced game. Int J Game Theory 30:147-165.
65. Hougaard JL, Peleg B, Østerdal LP (2005) The Dutta-Ray solution on the class of convex games: a generalization and monotonicity properties. Int Game Theory Review 7:1-12.
66. Housman D, Clark L (1998) Core and monotonic allocation methods. Int J Game Theory 27:611-616.
67. Ichiishi T (1981) Super modularity: applications to convex games and the greedy algorithm. J Econ Theory 25:283-286.
68. Lehrer E (2002) Allocation processes in cooperative games. Int J Game Theory 31:341-351.
69. Littlechild SC, Thompson GF (1977) Aircraft landing fees: a game theory approach. Bell J Econ 8:186-204.
70. Mirghani AN, Scapens RW (1995) Cost allocation theory and practice: the continuing debate. In: Ashton, Hopper, Scapens (eds) Issues in management accounting, chap. 3. Prentice-Hall, London, pp. 39-60.
71. Owen G (1995) Game theory, 3rd edn. Academic, New York.
72. Peleg B, Sudhölter P (2003) Introduction to the theory of cooperative games. Kluwer, Dordrecht.
73. Ransmeier JS (1942) The Tennessee Valley Authority: a case study in the economics of multiple purpose stream planning. Vanderbilt University Press, Nashville, TN.
74. Schmeidler D (1969) The Nucleolus of a characteristic function game. SIAM J Appl Math 17:1163-1170.
75. Shapley L (1953) A value for n-person games. Ann Math Stud 28:307-318.
76. Shapley L (1967) On balanced sets and cores. Naval Res Logist Q 14:453-460.
77. Shapley L (1971) Cores of convex games. Int J Game Theory 1:11-26.
78. Sobolev AI (1975) The characterization of optimality principles in cooperative games by functional equations. In: Vorobiev NN (ed) Mathematical methods in social sciences, vol 6. Academy of Sciences of the Lithunian SSR, Vilnius, pp. 95-151 (in Russian).
79. Sprumont Y (1990) Population monotonic allocation schemes for cooperative games with transferable utility. Games Econ Behav 2:378-394.
80. Suijs J (2000) Cooperative decision-making under risk. Kluwer, New York.
81. Taha HA (1989) Operations research, 2nd edn. Maxwell Macmillan, New York.
82. Tijs SH (1981) Bounds for the core and the τ-value. In: Moeschlin O, Pallaschke D (eds) Game theory and mathematical economics. North-Holland, Amsterdam, pp. 123-132.
83. Tijs SH (1987) An axiomatization of the τ-value. Math Soc Sci 13:177-181.
84. Tijs SH, Driessen TSH (1986) Game theory and cost allocation problems. Manage Sci 32:1015-1024.
85. Timmer J, Borm P, Tijs S (2003) On three Shapley-like solutions for cooperative games with random payoffs. Int J Game Theory 32:595-613.
86. van den Nouweland A, Borm P, van den Golstein Brouwers W, Groot Bruinderink R, Tijs S (1996) A game theoretic approach to problems in telecommunication. Manage Sci 42:294-303.
87. Young P (1985) Monotonic solutions of cooperative games. Int J Game Theory 14: 65-72.
88. Aumann R, Shapley L (1974) Values of non-atomic games. Princeton University Press, Princeton.
89. Beasley JE (2003) Allocating fixed costs and resources via data envelopment analysis. Eur J Oper Res 147:198-216.
90. Billera LJ, Heath C (1982) Allocation of shared costs: a set of axioms yielding a unique procedure. Math Oper Res 7:32-39.
91. Billera LJ, Heath DC, Raanan J (1978) Internal telephone billing rates-a novel application of non-atomic game theory. Oper Res 26:958-965.
92. Bogetoft P (1996) DEA on relaxed convexity assumptions. Manage Sci 42:457-465.
93. Bogetoft P, Tama JM, Tind J (2000) Convex input and output projections of non-convex production possibility sets. Manage Sci 46:858-869.
94. Friedman EJ (2003) Paths and consistency in additive cost sharing. Int J Game Theory 32:501-518.
95. Friedman EJ (2004) Strong monotonicity in surplus sharing. Econ Theory 23:643-658.
96. Friedman EJ, Moulin H (1999) Three methods to share joint costs or surplus. J Econ Theory 87:275-312.
97. Haimanko O (2000) Partially symmetric values. Math Oper Res 25:573-590.
98. Hart S, Mas-Colell A (1989) Potential, value, and consistency. Econometrica 57:589-614.
99. Hougaard JL, Tind J (2009) Cost allocation and convex data envelopment. Eur J Oper Res 194:939-947.
100. Kolpin V (1996) Multi-product serial cost sharing: an incomparability with the addi-tivity axiom. J Econ Theory 69:227-233.
101. Koster M (2007) The Moulin-Shenker rule. Soc Choice Welf 29:271-293.
102. Koster M, Tijs S, Borm P (1998) Serial cost sharing methods for multi-commodity situations. Math Soc Sci 36:229-242.
103. Mirman L, Tauman Y (1982) Demand compatible equitable cost sharing prices. Math Oper Res 7:40-56.
104. Moulin H, Shenker S (1994) Average cost pricing versus serial cost sharing: an axiomatic comparison. J Econ Theory 64:178-201.
105. Moulin H (2002) Axiomatic cost and surplus sharing. In: Arrow, Sen, Suzumura (eds) Handbook of social choice and welfare, chap.6. Elsevier, Amsterdam.
106. Moulin H, Sprumont Y (2005) On demand responsiveness in additive cost sharing. J Econ Theory 125:1-35.
107. Peleg B, Sudḧolter (2003) Introduction to the theory of cooperative games. Kluwer, Dordrecht.
108. Samet D, Tauman Y, Zang I (1984) An application of the Aumann-Shapley prices for cost allocation in transportation problems. Math Oper Res 9:25-42.
109. Shubik M (1962) Incentives, decentralized control, the assignment of joint costs and internal pricing. Manage Sci 8:325-343.
110. Sprumont Y (1998) Ordinal cost sharing. J Econ Theory 81:126-162.
111. Taha HA (1989) Operations research, 4th edn. Maxwell MacMillan, New York.
112. Tejedo C, Truchon M (2002) Serial cost sharing in multidimensional context. Math Soc Sci 44:277-299.
113. Young HP (1985) Producer incentives in cost allocation. Econometrica 53:757-764.
114. Wang Y-T, Zhu D (2002) Ordinal proportional cost sharing. J Math Econ 37:215-230.
115. Bird CG (1976) On cost allocation for a spanning tree: a game theoretic approach. Networks 6:335-350.
116. Bergantinos G, Vidal-Puga JJ (2007) A fair rule in minimum cost spanning tree problems. J Econ Theory 137:326-352.
117. Bogomolnaia A, Moulin H (2008) Sharing the cost of a minimal cost spanning tree: beyond the Folk solution (Manus).
118. Claus A, Kleitman DJ (1973) Cost allocation for a spanning tree. Networks 3:289-304.
119. Dutta B, Kar A (2004) Cost monotonicity, consistency and minimum cost spanning tree games. Games Econ Behav 48:223-248.
120. Dutta B, Mutuswami S (1997) Stable networks. J Econ Theory 76:322-344.
121. Granot D, Huberman G (1981) Minimum cost spanning tree games. Math Programming 21:1-18.
122. Henriet D, Moulin H (1996) Traffic-based cost allocation in a network. RAND J Econ 27:332-345.
123. Herzog S, Shenker S, Estrin D (1997) Sharing multicast costs. In McKnight, Bailey (eds) Internet economics. MIT, Cambridge, MA.
124. Hougaard JL, Moulin H, Østerdal LP (2008) Decentralized pricing in minimum cost spanning trees. Econ Theory, (forthcoming).
125. Jackson MO (2005) Allocation rules for network games. Games Econ Behav 51:128-154.
126. Jackson MO (2008) Social and economic networks. Princeton University Press, Princeton.
127. Jackson MO, Wolinsky A (1996) A strategic model of social and economic networks. J Econ Theory 71:44-74.
128. Kar A (2002) Axiomatization of the Shapley value on minimum cost spanning tree games. Games Econ Behav 38:265-277.
129. Koster M, Molina E, Sprumont Y, Tijs S (2001) Sharing the cost of a network: core and core allocations. Int J Game Theory 30:567-599.
130. Kruskal JB (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7:48-50.
131. Magnanti TL, Wolsey LA (1995) Optimal trees. In: Ball et al. (eds) Handbook in OR and MS. North-Holland, Amsterdam.
132. Megiddo N (1978) Cost allocation for Steiner trees. Networks 8:1-6.
133. Montemanni R (2006) A Benders decomposition approach for the robust spanning tree problem with interval data. Eur J Oper Res 174:1479-1490.
134. Myerson R (1977) Graphs and cooperation in games. Math Oper Res 2:225-229.
135. Newman MEJ (2003) The structure and function of complex networks. Soc Ind Appl Math 45:167-256.
136. Norde H, Moretti S, Tijs S (2004) Minimum cost spanning tree games and population monotonic allocation schemes. Eur J Oper Res 154:84-97.
137. Prim RC (1957) Shortest connection networks and some generalizations. Bell Syst Tech J 36:1389-1401.
138. Suijs J (2003) Cost allocation in spanning network enterprises with stochastic connection costs. Games Econ Behav 42:156-171.