zbMATH — the first resource for mathematics

Sharing a river. (English) Zbl 1033.91503
Summary: A group of agents located along a river have quasi-linear preferences over water and money. We ask how the water should be allocated and what money transfers should be performed. The core lower bounds require that no coalition should get less than the welfare it could achieve by using the water it controls. The aspiration upper bounds demand that no coalition enjoy a welfare higher than what it could achieve in the absence of the remaining agents. Exactly one welfare distribution satisfies the core lower bounds and the aspiration upper bounds: it is the marginal contribution vector corresponding to the ordering of the agents along the river.

91B76 Environmental economics (natural resource models, harvesting, pollution, etc.)
91A12 Cooperative games
91A40 Other game-theoretic models
91B32 Resource and cost allocation (including fair division, apportionment, etc.)
Full Text: DOI
[1] Barret, S., Policy research working paper 1303, (1994)
[2] Coase, R., The problem of social cost, J. law econ., 1, 1-44, (1960)
[3] Dutta, B.; Ray, D., A concept of egalitarianism under participation constraints, Econometrica, 57, 615-635, (1989) · Zbl 0703.90105
[4] Godana, B., Africa’s shared water resources, (1985), Frances Pinter London
[5] Greenberg, J.; Weber, S., Strong tiebout equilibrium under restricted preferences domain, J. econ. theory, 38, 101-117, (1986) · Zbl 0592.90017
[6] Kilgour, M.; Dinar, A., Policy research working paper 1474, (1996)
[7] Locke, J., ()
[8] Moulin, H., Uniform externalities: two axioms for fair allocation, J. pub. econ., 43, 305-326, (1990)
[9] Sharkey, W., Network models in economics, (), 713-765 · Zbl 0861.90023
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.