No abstract

No abstract

We analyse the redistribution of a resource amongst 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 the class of sequential sharing rules. Subsequently, we apply sequential sharing rules based on four classical bankruptcy rules, assess their properties, provide two characterisations of one specific rule, and compare sequential sharing rules with three alternative solutions to the river sharing problem.

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte. Terms of use: Documents in Cartel Stability under an Optimal Sharing Rule SummaryPrevious work on the formation and stability of cartels has focused on the case of identical players. This assumption is very restrictive in many economic environments. This paper analyses stability of cartels in games with heterogeneous players and spillovers to non-members. I introduce a sharing rule for coalition payoffs, called "optimal sharing" which stabilises all cartels that are possibly stable under any rule. Under optimal sharing the grand coalition is the unique stable cartel if spillovers are negative. I introduce a new property, called "non-essentiality" and determine the set of stable cartels under optimal sharing if spillovers are positive and if the non-essentiality property applies. Finally I analyse cartel stability under optimal sharing in simple public goods game with heterogeneous players. My results show -in contrast to earlier findings for identical players -that large coalitions may well be stable.

No abstract