Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/53343 
Kompletter Metadatensatz
DublinCore-FeldWertSprache
dc.contributor.authorAnsink, Eriken
dc.contributor.authorWeikard, Hans-Peteren
dc.date.accessioned2011-12-15T11:33:33Z-
dc.date.available2011-12-15T11:33:33Z-
dc.date.issued2009-
dc.identifier.urihttp://hdl.handle.net/10419/53343-
dc.description.abstractWe analyse the redistribution of a resource among agents who have claims to the resource and who are ordered linearly. A well known example of this particular situation is the river sharing problem. We exploit the linear order of agents to transform the river sharing problem to a sequence of two-agent river sharing problems. These reduced problems are mathematically equivalent to bankruptcy problems and can therefore be solved using any bankruptcy rule. Our proposed class of solutions, that we call sequential sharing rules, solves the river sharing problem. Our approach extends the bankruptcy literature to settings with a sequential structure of both the agents and the resource to be shared. In the paper, we first characterise a class of sequential sharing rules. Subsequently, we apply sequential sharing rules based on four classical bankruptcy rules, assess their properties, and compare them to four alternative solutions to the river sharing problem.en
dc.language.isoengen
dc.publisher|aFondazione Eni Enrico Mattei (FEEM) |cMilanoen
dc.relation.ispartofseries|aNota di Lavoro |x114.2009en
dc.subject.jelD63en
dc.subject.jelD71en
dc.subject.jelQ25en
dc.subject.ddc330en
dc.subject.keywordRiver Sharing Problemen
dc.subject.keywordSequential Sharing Ruleen
dc.subject.keywordBankruptcy Problemen
dc.subject.keywordWater Allocationen
dc.titleSequential sharing rules for river sharing problems-
dc.typeWorking Paperen
dc.identifier.ppn646491075en
dc.rightshttp://www.econstor.eu/dspace/Nutzungsbedingungenen

Datei(en):
Datei
Größe
297.75 kB





Publikationen in EconStor sind urheberrechtlich geschützt.