Axiomatization of the counting rule for cost-sharing with possibly redundant items
From MaRDI portal
Publication:2125113
DOI10.1007/s00355-021-01368-1zbMath1484.91224OpenAlexW3206002776MaRDI QIDQ2125113
Gildas Sédry Fopa, Issofa Moyouwou, Joseph Siani
Publication date: 13 April 2022
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00355-021-01368-1
Cites Work
- Unnamed Item
- Unnamed Item
- Cost allocation in asymmetric trees
- Sharing the cost of redundant items
- Equal-need sharing of a network under connectivity constraints
- Distributive justice in taxation
- The proportional Shapley value and applications
- On the axiomatic method and its recent applications to game theory and resource allocation
- A new rule for source connection problems
- COST SHARING IN NETWORKS: SOME OPEN QUESTIONS
- An Introduction to Allocation Rules
- Priority Rules and Other Asymmetric Rationing Methods
This page was built for publication: Axiomatization of the counting rule for cost-sharing with possibly redundant items