On the Discrete Version of the Aumann-Shapley Cost-Sharing Method
From MaRDI portal
Publication:5393896
DOI10.1111/j.1468-0262.2005.00633.xzbMath1151.91453MaRDI QIDQ5393896
Publication date: 24 October 2006
Published in: Econometrica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1468-0262.2005.00633.x
91A12: Cooperative games
91B24: Microeconomic theory (price theory and economic markets)
91B32: Resource and cost allocation (including fair division, apportionment, etc.)
Related Items
Revenue Sharing in Airline Alliance Networks, Cost Sharing in Production Economies, Some characterizations of generalized top trading cycles, Monotonicity and the Aumann-Shapley cost-sharing method in the discrete case, Capital allocation for portfolios with non-linear risk aggregation, Progressive and merging-proof taxation, The implications of the ranking axiom for discrete cost sharing methods, Proportional scheduling, split-proofness, and merge-proofness, Nearly serial sharing methods, The serial property and restricted balanced contributions in discrete cost sharing problems, Cost sharing with multiple technologies, Consistency requirements and pattern methods in cost sharing problems with technological cooperation, Sharing sequential values in a network, A solution for discrete cost sharing problems with non rival consumption, Marginalism, egalitarianism and efficiency in multi-choice games, Reassignment-proof rules for land rental problems, Does it make sense to analyse a two-sided market as a multi-choice game?, Knapsack cost sharing, Stability and fairness in the job scheduling problem, A generalization of the Aumann-Shapley value for risk capital allocation problems, Stable cost sharing in production allocation games, A discrete cost sharing model with technological cooperation
