Allocation rules on networks

When allocating a resource, geographical and infrastructural constraints have to be taken into account. We study the problem of distributing a resource through a network from sources endowed with the resource to citizens with claims. A link between a source and an agent depicts the possibility of a...

Descripción completa

Detalles Bibliográficos
Autores Principales: Ilkiliç, Rahmi, Kayi, Cagatay
Formato: Documento de trabajo (Working Paper)
Lenguaje:Español (Spanish)
Publicado: Universidad del Rosario 2012
Materias:
Acceso en línea:http://repository.urosario.edu.co/handle/10336/10828
id ir-10336-10828
recordtype dspace
institution EdocUR - Universidad del Rosario
collection DSpace
language Español (Spanish)
topic Economía
Distribución (Teoría Económica)
Análisis coste::Beneficio
Internet (Red De Computadores)::Aspectos Económicos
Networks
Claims problems
Egalitarianism
Proportionality
Equal sacrifice
spellingShingle Economía
Distribución (Teoría Económica)
Análisis coste::Beneficio
Internet (Red De Computadores)::Aspectos Económicos
Networks
Claims problems
Egalitarianism
Proportionality
Equal sacrifice
Ilkiliç, Rahmi
Kayi, Cagatay
Allocation rules on networks
description When allocating a resource, geographical and infrastructural constraints have to be taken into account. We study the problem of distributing a resource through a network from sources endowed with the resource to citizens with claims. A link between a source and an agent depicts the possibility of a transfer from the source to the agent. Given the supplies at each source, the claims of citizens, and the network, the question is how to allocate the available resources among the citizens. We consider a simple allocation problem that is free of network constraints, where the total amount can be freely distributed. The simple allocation problem is a claims problem where the total amount of claims is greater than what is available. We focus on consistent and resource monotonic rules in claims problems that satisfy equal treatment of equals. We call these rules fairness principles and we extend fairness principles to allocation rules on networks. We require that for each pair of citizens in the network, the extension is robust with respect to the fairness principle. We call this condition pairwise robustness with respect to the fairness principle. We provide an algorithm and show that each fairness principle has a unique extension which is pairwise robust with respect to the fairness principle. We give applications of the algorithm for three fairness principles: egalitarianism, proportionality and equal sacrifice.
format Documento de trabajo (Working Paper)
author Ilkiliç, Rahmi
Kayi, Cagatay
author_facet Ilkiliç, Rahmi
Kayi, Cagatay
author_sort Ilkiliç, Rahmi
title Allocation rules on networks
title_short Allocation rules on networks
title_full Allocation rules on networks
title_fullStr Allocation rules on networks
title_full_unstemmed Allocation rules on networks
title_sort allocation rules on networks
publisher Universidad del Rosario
publishDate 2012
url http://repository.urosario.edu.co/handle/10336/10828
_version_ 1712098737272127488
spelling ir-10336-108282021-09-07T04:58:23Z Allocation rules on networks Ilkiliç, Rahmi Kayi, Cagatay Economía Distribución (Teoría Económica) Análisis coste::Beneficio Internet (Red De Computadores)::Aspectos Económicos Networks Claims problems Egalitarianism Proportionality Equal sacrifice When allocating a resource, geographical and infrastructural constraints have to be taken into account. We study the problem of distributing a resource through a network from sources endowed with the resource to citizens with claims. A link between a source and an agent depicts the possibility of a transfer from the source to the agent. Given the supplies at each source, the claims of citizens, and the network, the question is how to allocate the available resources among the citizens. We consider a simple allocation problem that is free of network constraints, where the total amount can be freely distributed. The simple allocation problem is a claims problem where the total amount of claims is greater than what is available. We focus on consistent and resource monotonic rules in claims problems that satisfy equal treatment of equals. We call these rules fairness principles and we extend fairness principles to allocation rules on networks. We require that for each pair of citizens in the network, the extension is robust with respect to the fairness principle. We call this condition pairwise robustness with respect to the fairness principle. We provide an algorithm and show that each fairness principle has a unique extension which is pairwise robust with respect to the fairness principle. We give applications of the algorithm for three fairness principles: egalitarianism, proportionality and equal sacrifice. 2012-03 2015-09-18T18:37:43Z info:eu-repo/semantics/workingPaper info:eu-repo/semantics/acceptedVersion Ilkiliç, R., & Kayi, Ç. (2012). Allocation rules on networks. Bogotá: Universidad del Rosario, Facultad de Economía. http://repository.urosario.edu.co/handle/10336/10828 Universidad del Rosario, Facultad de Economía spa info:eu-repo/semantics/openAccess application/pdf Universidad del Rosario Facultad de Economía instname:Universidad del Rosario reponame:Repositorio Institucional EdocUR instname:Universidad del Rosario Ambec, S. and L. Ehlers (2008). Sharing a river among satiable agents. Games and Economic Behavior 64, 35–50. Ambec, S. and Y. Sprumont (2002). Sharing a river. Journal of Economic Theory 107, 453–462. Ansink, E. and H. P. Weikard (2009). Contested water rights. European Journal of Political Economy 25, 247–260. Ansink, E. and H. P. Weikard (2011). A strategic model of social and economic networks. Social Choice and Welfare. (forthcoming). Bjørndal, E. and K. J¨ornsten (2010). Flow sharing and bankruptcy games. International Journal of Game Theory 39, 11–28. Bochet, O., R. ˙Ilkılı¸c, and H. Moulin (2010). Egalitarianism under earmark constraints. mimeo. University of Bern, Bern, Switzerland. Bochet, O., R. ˙Ilkılı¸c, H. Moulin, and J. Sethuraman (2011). Balancing supply and demand under bilateral constraints. Theoretical Economics. (forthcoming). Branzei, R., G. Ferrari, V. Fragnelli, and S. Tijs (2008). A flow approach to bankruptcy problems. AUCO Czech Economic Review 2, 146–153. Brown, J. (1979). The sharing problem. Operations Research 27, 324–340. Hall, N. G. and R. Vohra (1993). Towards equitable distribution via proportional equity constraints. Mathematical Programming 58, 287–294. Hoekstra, A. (2006). The global dimension of water governance: Nine reasons for global arrangements in order to cope with local problems. Value of Water Research Report Series 20. UNESCO-IHE Institute for Water Education. ˙Ilkılı¸c, R. (2007). Network of commons. mimeo. Maastricht University. Maastricht, the Netherlands Kar, A. and O. Kıbrıs (2008). Allocating multiple estates among agents with single-peaked preferences. Social Choice and Welfare 31, 641–666. Klaus, B., H. Peters, and T. Storcken (1997). Reallocation of an infinitely divisible good. Economic Theory 10, 305–333. Klaus, B., H. Peters, and T. Storcken (1998). Strategy-proof division with singlepeaked preferences and individual endowments. Social Choice and Welfare 15, 297–311. Sprumont, Y. (1991). The division problem with single-peaked preferences: A characterization of the uniform allocation rule. Econometrica 59, 509–519. Thomson, W. (2003). Axiomatic analysis of bankruptcy and taxation problems: a survey. Mathematical Social Sciences 45, 249–297. Thomson, W. (2006). How to divide when there isnt enough: From the talmud to game theory. mimeo. University of Rochester, Rochester, NY, USA.
score 12,131701