Nearly serial sharing methods

DOI10.1007/S00182-008-0119-4MaRDI QIDQ933762zbMATH OpenOpenAlexFDO

Authors Yves Sprumont

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

zbMATH Keywords

Cost sharingGroup monotonicitySerial methodSurplus sharing

Mathematics Subject Classification ID

Cooperative games (91A12)

Recommendations

• Sharing sequential values in a network
• Serial Cost Sharing
• Serial cost sharing methods for multi-commodity situations
• scientific article; zbMATH DE number 512874
• A unified approach to fully lazy sharing
• Stable sharing
• scientific article; zbMATH DE number 1706206

Cites work

• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Allocation of Shared Costs: A Set of Axioms Yielding A Unique Procedure
• Average cost pricing versus serial cost sharing: An axiomatic comparison
• Characterization of additive cost sharing methods
• Demand Compatible Equitable Cost Sharing Prices
• Incentives, decentralized control, the assignment of joint costs and internal pricing
• On demand responsiveness in additive cost sharing
• On the Discrete Version of the Aumann-Shapley Cost-Sharing Method
• Paths and consistency in additive cost sharing
• Responsibility and cross-subsidization in cost sharing
• Serial Cost Sharing
• Three methods to share joint costs or surplus
• Values of Non-Atomic Games

Cited in

(5)

• Sharing sequential values in a network
• Consistency requirements and pattern methods in cost sharing problems with technological cooperation
• Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
• Shapley-Shubik methods in cost sharing problems with technological cooperation
• The implications of the ranking axiom for discrete cost sharing methods

This page was built for publication: Nearly serial sharing methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q933762)