Allocation rules on networks

被引:0
|
作者
Rahmi İlkılıç
Çağatay Kayı
机构
[1] Bilkent University,Department of Economics
[2] Universidad del Rosario,Facultad de Economía
来源
Social Choice and Welfare | 2014年 / 43卷
关键词
Allocation Problem; Simple Problem; Allocation Rule; Network Constraint; Bipartite Network;
D O I
暂无
中图分类号
学科分类号
摘要
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 a citizen depicts the possibility of a transfer from the source to the citizen. Given the endowments 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 resource monotonic and anonymous bilateral principles satisfying a regularity condition and extend these principles to allocation rules on networks. We require the extension to preserve the essence of the bilateral principle for each pair of citizens in the network. We call this condition pairwise robustness with respect to the bilateral principle. We provide an algorithm and show that each bilateral principle has a unique extension which is pairwise robust (Theorem 1). Next, we consider a Rawlsian criteria of distributive justice and show that there is a unique “Rawls fair” rule that equals the extension given by the algorithm (Theorem 2). Pairwise robustness and Rawlsian fairness are two sides of the same coin, the former being a pairwise and the latter a global requirement on the allocation given by a rule. We also show as a corollary that any parametric principle can be extended to an allocation rule (Corollary 1). Finally, we give applications of the algorithm for the egalitarian, the proportional, and the contested garment bilateral principles (Example 1).
引用
收藏
页码:877 / 892
页数:15
相关论文
共 50 条
  • [1] Allocation rules on networks
    Ilkilic, Rahmi
    Kayi, Cagatay
    [J]. SOCIAL CHOICE AND WELFARE, 2014, 43 (04) : 877 - 892
  • [2] Allocation Rules for Networks Inspired by Cooperative Game-Theory
    Caulier, Jean-Francois
    Skoda, Alexandre
    Tanimura, Emily
    [J]. REVUE D ECONOMIE POLITIQUE, 2017, 127 (04): : 517 - 558
  • [3] Bandit Problems in Networks: Asymptotically Efficient Distributed Allocation Rules
    Kar, Soummya
    Poor, H. Vincent
    Cui, Shuguang
    [J]. 2011 50TH IEEE CONFERENCE ON DECISION AND CONTROL AND EUROPEAN CONTROL CONFERENCE (CDC-ECC), 2011, : 1771 - 1778
  • [4] PROBABILISTIC ALLOCATION RULES
    VICTOR, N
    [J]. METHODS OF INFORMATION IN MEDICINE, 1973, 12 (04) : 238 - 244
  • [5] Allocation: The Rules of the Game
    Andreoni, Kenneth A.
    [J]. AMERICAN JOURNAL OF TRANSPLANTATION, 2013, 13 : 56 - 56
  • [6] Implementable Allocation Rules
    Monderer, Dov
    [J]. ACM SIGECOM EXCHANGES, 2008, 7 (02)
  • [7] STOCHASTIC ALLOCATION RULES
    AGNIHOTHRI, S
    KARMARKAR, US
    KUBAT, P
    [J]. OPERATIONS RESEARCH, 1982, 30 (03) : 545 - 555
  • [8] Aid allocation rules
    Carter, Patrick
    [J]. EUROPEAN ECONOMIC REVIEW, 2014, 71 : 132 - 151
  • [9] SAFAR: Simulated Annealing-Based Flow Allocation Rules for Industrial Networks
    Saha, Barun Kumar
    Haab, Luca
    Podleski, Lukasz
    [J]. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2021, 18 (03): : 3771 - 3782