On the Discrete Version of the Aumann-Shapley Cost-Sharing Method
From MaRDI portal
Publication:5393896
DOI10.1111/J.1468-0262.2005.00633.XzbMATH Open1151.91453OpenAlexW2158083250MaRDI QIDQ5393896FDOQ5393896
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
Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Microeconomic theory (price theory and economic markets) (91B24)
Cited In (23)
- Does it make sense to analyse a two-sided market as a multi-choice game?
- Revenue Sharing in Airline Alliance Networks
- Marginalism, egalitarianism and efficiency in multi-choice games
- Stable cost sharing in production allocation games
- Stability and fairness in the job scheduling problem
- Sharing sequential values in a network
- Consistency requirements and pattern methods in cost sharing problems with technological cooperation
- Nearly serial sharing methods
- Cost Sharing in Production Economies
- Progressive and merging-proof taxation
- Title not available (Why is that?)
- The serial property and restricted balanced contributions in discrete cost sharing problems
- Monotonicity and the Aumann-Shapley cost-sharing method in the discrete case
- The implications of the ranking axiom for discrete cost sharing methods
- Proportional scheduling, split-proofness, and merge-proofness
- A generalization of the Aumann-Shapley value for risk capital allocation problems
- A solution for discrete cost sharing problems with non rival consumption
- Cost sharing with multiple technologies
- Reassignment-proof rules for land rental problems
- A discrete cost sharing model with technological cooperation
- Knapsack cost sharing
- Some characterizations of generalized top trading cycles
- Capital allocation for portfolios with non-linear risk aggregation
This page was built for publication: On the Discrete Version of the Aumann-Shapley Cost-Sharing Method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5393896)
