Mechanism Design with Exchangeable Allocations
نویسنده
چکیده
We investigate mechanism design without payments when agents have different types of preferences. Contrary to most settings in the literature where agents have the same preference, e.g. in the facility location games all agents would like to stay close to (or away from) the facility, we demonstrate the limitation of mechanism design without payments when agents have different preferences by introducing exchanging phases. We consider two types of exchanging phases. The first model is called central exchanges where the exchanges are performed by a central authority. The other model is called individual exchanges where agents exchange their outcomes by themselves. By using facility location games as an example, we provide a truthful mechanism that optimizes social welfare in central exchanges. We also provide a universally truthful randomized mechanism that achieves at least a half of the optimal social welfare in individual exchanges.
منابع مشابه
A characterization of product-form exchangeable feature probability functions
We characterize the class of exchangeable feature allocations assigning probability Vn,k ∏k l=1WmlUn−ml to a feature allocation of n individuals, displaying k features with counts (m1, . . . ,mk) for these features. Each element of this class is parametrized by a countable matrix V and two sequences U and W of non-negative weights. Moreover, a consistency condition is imposed to guarantee that ...
متن کاملFeature Allocations, Probability Functions, and Paintboxes
The problem of inferring a clustering of a data set has been the subject of much research in Bayesian analysis, and there currently exists a solid mathematical foundation for Bayesian approaches to clustering. In particular, the class of probability distributions over partitions of a data set has been characterized in a number of ways, including via exchangeable partition probability functions ...
متن کاملA Proposed Mechanism for the Iranian Model of Kidney Donation (A Comparison of the Iranian and Roth’s Models)
Optimal resource allocation by means of the price mechanism is one of the main duties of the economics. Optimum allocation is sometimes realized not through the price mechanism, but via assignment algorithms due to an insufficient number of agents on either side of the exchange. Facing the same problem, the kidney market may be considered as a type of market failure that calls for market design...
متن کاملEquilibrium Participation in Public Goods Allocations
We consider a notion of voluntary participation for mechanism design in public goods economies in which mechanisms select public goods allocations and individuals then choose whether or not to submit their requested transfer to the central planner. The set of allocations that are robust to non-participation is shown to be sub-optimal in a wide variety of environments and may shrink to the endow...
متن کاملEx post renegotiation-proof mechanism design
We study what kind of equilibria of which mechanisms are ex post renegotiation-proof (EPRP), i.e., robust against the possibility of ex post renegotiation under a variety of renegotiation procedures, and which social choice functions are EPRP implementable. In complete information environments with two agents only budget balanced Groves allocations are EPRP implementable, while with three or mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1609.04782 شماره
صفحات -
تاریخ انتشار 2016