Quantifying Inefficiency of Fair Cost-Sharing Mechanisms for Sharing Economy
نویسندگان
چکیده
منابع مشابه
Quantifying Inefficiency of Fair Cost-Sharing Mechanisms for Sharing Economy
Sharing economy, a distributed peer-to-peer eco-nomic paradigm, gives rise to a variety of social interactionsfor economic reasons. One common distributed decision-makingprocess is the coalition formation to share certain replaceable re-sources collaboratively, for example, sharing hotel rooms amongtravelers, sharing taxi-rides among passengers, and sharingregular passes...
متن کاملCost Sharing Mechanisms for Fair Pricing of Resources Usage
We propose a simple and intuitive cost mechanism which assigns costs for the competitive usage of m resources by n selfish agents. Each agent has an individual demand; demands are drawn according to some probability distribution. The cost paid by an agent for a resource she chooses is the total demand put on the resource divided by the number of agents who chose that same resource. So, resource...
متن کاملGroups performance ranking based on inefficiency sharing
In the real world there are groups which composed of independent units. The conventional data envelopment analysis(DEA) model treats groups as units, ignoring the operation of individual units within each group.The current paper, investigates parallel system network approach proposed by Kao and modifies it. As modied Kao' model is more eligible to recognize ecient groups, a new ranking method i...
متن کاملAsymmetric Cost Sharing mechanisms
We describe the construction and analysis of asymmetric Cost Sharing mechanisms, in which a variety of axioms are applied to subsets of the agents/goods. We show that the analysis can be quite subtle as apparently similar axiomatizations lead to significantly different results; in particular, combinations of symmetric mechanisms can be extremely asymmetric and biased. In addition, we characteri...
متن کاملApproximately Efficient Cost-Sharing Mechanisms
We study cost-sharing mechanisms for several fundamental NP-hard combinatorial optimization problems. A cost-sharing mechanism is a protocol that, given bids for a service, determines which bidders to serve and what prices to charge. The mechanism incurs a subset-dependent cost that is implicitly defined by an instance of a combinatorial optimization problem. Three desirable but mutually incomp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Control of Network Systems
سال: 2018
ISSN: 2325-5870,2372-2533
DOI: 10.1109/tcns.2017.2763747