Nearly serial sharing methods
From MaRDI portal
Publication:933762
DOI10.1007/s00182-008-0119-4zbMath1152.91011OpenAlexW2052162872MaRDI QIDQ933762
Publication date: 25 July 2008
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: http://www.cireqmontreal.com/wp-content/uploads/cahiers/17-2004-cah.pdf
Related Items
Consistency requirements and pattern methods in cost sharing problems with technological cooperation, Shapley-Shubik methods in cost sharing problems with technological cooperation, The implications of the ranking axiom for discrete cost sharing methods, Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
Cites Work
- Unnamed Item
- Average cost pricing versus serial cost sharing: An axiomatic comparison
- Paths and consistency in additive cost sharing
- Three methods to share joint costs or surplus
- Characterization of additive cost sharing methods
- Responsibility and cross-subsidization in cost sharing
- On demand responsiveness in additive cost sharing
- Incentives, Decentralized Control, the Assignment of Joint Costs and Internal Pricing
- Demand Compatible Equitable Cost Sharing Prices
- Serial Cost Sharing
- 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