An Introduction to Allocation Rules

DOI10.1007/978-3-642-01828-2zbMath1178.91001OpenAlexW624862470MaRDI QIDQ3631733

Jens Leth Hougaard

Publication date: 10 June 2009

Full work available at URL: https://doi.org/10.1007/978-3-642-01828-2

zbMATH Keywords

cost allocationcooperative gameallocation rulesharing problemcost and surplus

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to game theory, economics, and finance (91-02) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (11)

Axiomatization of the counting rule for cost-sharing with possibly redundant items ⋮ Risk capital allocation with autonomous subunits: the Lorenz set ⋮ Sharing sequential values in a network ⋮ Sharing the cost of risky projects ⋮ Applied cost allocation: the DEA-Aumann-Shapley approach ⋮ Routing-proofness in congestion-prone networks ⋮ Lorenz comparison between increasing serial and Shapley value cost-sharing rules ⋮ The pseudo-average rule: bankruptcy, cost allocation and bargaining ⋮ A conceptual model for FRAND royalty setting ⋮ Mathematical aspects of degressive proportionality ⋮ Allocation inequality in cost sharing problem

This page was built for publication: An Introduction to Allocation Rules