Monotonicity and the Aumann-Shapley cost-sharing method in the discrete case
From MaRDI portal
Publication:296806
DOI10.1016/j.ejor.2014.03.044zbMath1338.91083OpenAlexW1980901192MaRDI QIDQ296806
M. Josune Albizuri, A. Sarachu, Henar Díez
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.03.044
Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Cites Work
- Unnamed Item
- Unnamed Item
- Cost allocation and convex data envelopment
- Monotonic solutions of cooperative games
- Conference structures and fair allocation rules
- Ordinal cost sharing
- Average cost pricing versus serial cost sharing: An axiomatic comparison
- Cooperative game solution concepts to a cost allocation problem.
- Coherent cost-sharing rules
- The Aumann-Shapley price mechanism for allocating congestion costs
- The additivity and dummy axioms in the discrete cost sharing model
- A discrete cost sharing model with technological cooperation
- Additive rules in discrete allocation problems
- Incentives, Decentralized Control, the Assignment of Joint Costs and Internal Pricing
- Internal Telephone Billing Rates—A Novel Application of Non-Atomic Game Theory
- An Application of the Aumann-Shapley Prices for Cost Allocation in Transportation Problems
- Producer Incentives in Cost Allocation
- The Determination of Marginal Cost Prices under a Set of Axioms
- Demand Compatible Equitable Cost Sharing Prices
- Value Theory Without Efficiency
- Values of Non-Atomic Games
- Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure
- On the Discrete Version of the Aumann-Shapley Cost-Sharing Method
- Potential, Consistency, and Cost Allocation Prices
- A value for multichoice games
This page was built for publication: Monotonicity and the Aumann-Shapley cost-sharing method in the discrete case
