Cheating by groups and cheating over time in surplus sharing problems

DOI10.1016/S0165-4896(98)00041-9zbMath0929.91004MaRDI QIDQ1296454

Andreas Pfingsten

Publication date: 2 August 1999

Published in: Mathematical Social Sciences (Search for Journal in Brave)

zbMATH Keywords

surplus sharingcheating by groups

Mathematics Subject Classification ID

Cooperative games (91A12) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (1)

Constrained welfare egalitarianism in surplus-sharing problems

Cites Work

• Unnamed Item
• The separability axiom and equal-sharing methods
• Equal or proportional division of a surplus, and other methods
• A noncooperative justification for egalitarian surplus sharing
• Surplus-sharing methods
• Rationing a commodity along fixed paths
• The Division Problem with Single-Peaked Preferences: A Characterization of the Uniform Allocation Rule
• Strategyproof sharing of submodular costs: budget balance versus efficiency

This page was built for publication: Cheating by groups and cheating over time in surplus sharing problems