论文标题
关于一般网络中可分配和不可分割商品的配给的注释
A note on the rationing of divisible and indivisible goods in a general network
论文作者
论文摘要
匹配理论的研究最近在肾脏交易所，房屋分配，学校选择等方面的应用。这些问题的一般主题是在参与的代理商中以公平的方式分配商品。代理商通常具有他们想要与其他代理商交换的商品的单位供应/需求。另一方面，Bochet等人。研究问题的更一般版本，在该版本中，他们允许代理商将任意数量的可分配商品定为网络中的其他代理。在目前的工作中，我们的主要重点是非双方网络，在这些网络中，代理具有与邻居交流的同质不可分割的好处的任意单位。我们的目的是开发将确定网络中代理商的公平和战略性分配的机制。因此，我们将肾脏交换问题推广到具有任意商品能力的网络的问题。我们的主要思想是，这个问题和其他几个相关版本的非双分配公平分配问题可以正当地转换为双方网络上的公平分配之一，我们知道，我们知道，研究经过良好的公平分配机制。
The study of matching theory has gained importance recently with applications in Kidney Exchange, House Allocation, School Choice etc. The general theme of these problems is to allocate goods in a fair manner amongst participating agents. The agents generally have a unit supply/demand of a good that they want to exchange with other agents. On the other hand, Bochet et al. study a more general version of the problem where they allow for agents to have arbitrary number of divisible goods to be rationed to other agents in the network. In this current work, our main focus is on non-bipartite networks where agents have arbitrary units of a homogeneous indivisible good that they want to exchange with their neighbors. Our aim is to develop mechanisms that would identify a fair and strategyproof allocation for the agents in the network. Thus, we generalize the kidney exchange problem to that of a network with arbitrary capacity of available goods. Our main idea is that this problem and a couple of other related versions of non-bipartite fair allocation problem can be suitably transformed to one of fair allocations on bipartite networks for which we know of well studied fair allocation mechanisms.
