Strong monotonicity in surplus sharing
暂无分享,去创建一个
[1] M. Shubik. Incentives, Decentralized Control, the Assignment of Joint Costs and Internal Pricing , 1962 .
[2] H. Moulin,et al. Serial Cost Sharing , 1992 .
[3] Eric J. Friedman,et al. Paths and consistency in additive cost sharing , 2004, Int. J. Game Theory.
[4] Hervé Moulin,et al. Traffic Based Cost Allocation in Network , 1996 .
[5] Andrew B. Whinston,et al. An Axiomatic Approach to Cost Allocation for Public Investment , 1974 .
[6] Scott Shenker,et al. Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism , 1992, SIGCOMM '92.
[7] William W. Sharkey,et al. Weighted Aumann-Shapley pricing , 1998, Int. J. Game Theory.
[8] Yves Sprumont. Coherent Cost-Sharing Rules , 2000, Games Econ. Behav..
[9] José Alcalde,et al. A Procedure For Sharing Recycling Costs , 2000 .
[10] J. Leroux. Strategyproof Profit Sharing: A Two-Agent Characterization , 2005 .
[11] A. Mas-Colell,et al. Remarks on the game-theoretic analysis of a simple distribution of surplus problem , 1980 .
[12] P. Champsaur,et al. How to share the cost of a public good? , 1975 .
[13] John E. Roemer,et al. A Public Ownership Resolution of the Tragedy of the Commons , 1989, Social Philosophy and Policy.
[14] Hervé Moulin,et al. Axiomatic cost and surplus sharing , 2002 .
[15] Eric J. Friedman,et al. Three Methods to Share Joint Costs or Surplus , 1999 .
[16] Hervé Moulin,et al. ON ADDITIVE METHODS TO SHARE JOINT COSTS , 1995 .
[17] Yves Sprumont. Ordinal Cost Sharing , 1998 .
[18] Deborah Estrin,et al. Sharing the “cost” of multicast trees: an axiomatic analysis , 1997, TNET.
[19] Louis J. Billera,et al. Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure , 1982, Math. Oper. Res..
[20] H. Moulin. Equal or proportional division of a surplus, and other methods , 1987 .
[21] John A. Aloysius,et al. The selection of joint projects by a consortium: Cost sharing mechanisms , 1999, J. Oper. Res. Soc..
[22] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .
[23] Scott Shenker,et al. Making greed work in networks: a game-theoretic analysis of switch service disciplines , 1995, TNET.
[24] Ori Haimanko. Value theory without symmetry , 2000, Int. J. Game Theory.
[25] L. S. Shapley,et al. 17. A Value for n-Person Games , 1953 .
[26] S. Rajagopalan,et al. Capacity Expansion and Equipment Replacement: A Unified Approach , 1998, Oper. Res..
[27] Louis J. Billera,et al. Internal Telephone Billing Rates - A Novel Application of Non-Atomic Game Theory , 1978, Oper. Res..
[28] Eric J. Friedman,et al. Strategic properties of heterogeneous serial cost sharing , 2002, Math. Soc. Sci..
[29] M. Pereira,et al. An integrated framework for cost allocation in a multi-owned transmission system , 1995 .
[30] L. Shapley,et al. Values of Non-Atomic Games , 1974 .
[31] David F. Pyke,et al. Inventory management and production planning and scheduling , 1998 .
[32] J. A. Smiley,et al. Incentives , 2019, Handbook of Research Methods and Applications in Experimental Economics.
[33] Ori Haimanko. Partially Symmetric Values , 2000, Math. Oper. Res..
[34] Philip Wolfe,et al. Contributions to the theory of games , 1953 .
[35] L. D. Israelseni. Collectives, communes and incentives. , 1980 .
[36] Yair Tauman,et al. Demand Compatible Equitable Cost Sharing Prices , 1982, Math. Oper. Res..
[37] Scott Shenker,et al. Efficient Network Allocations with Selfish Users , 1990, Performance.
[38] J. M. Bilbao,et al. Contributions to the Theory of Games , 2005 .
[39] E T. Leighton,et al. Introduction to parallel algorithms and architectures , 1991 .
[40] H. Young. Producer Incentives in Cost Allocation , 1985 .
[41] Amartya Sen,et al. Labour Allocation in a Cooperative Enterprise , 1966 .