Optimal tax problems with multidimensional heterogeneity: a mechanism design approach
نویسندگان
چکیده
We propose a new method, that we call an allocation perturbation, to derive the optimal nonlinear income tax schedules with multidimensional individual characteristics on which taxes cannot be conditioned. It is well established that, when individuals differ in terms of preferences top their skills, marginal rates can negative. In contrast, show heterogeneous behavioral responses and one has positive rates, under utilitarian maximin.
منابع مشابه
Truthful Mechanism Design for Multidimensional Covering Problems
We investigate multidimensional covering mechanism-design problems, wherein there are m items that need to be covered and n agents who provide covering objects, with each agent i having a private cost for the covering objects he provides. The goal is to select a set of covering objects of minimum total cost that together cover all the items. We focus on two representative covering problems: unc...
متن کاملA characterization of optimal feasible tax mechanism
In this paper, we study the following question: For a public good economy where the provision of public goods is to be financed by property taxes collected from individuals, what is the optimal feasible tax mechanism when a social planner is relatively uninformed of the properties of the individuals? Using a Bayesian model, we provide the full characterization of the optimal feasible tax mechan...
متن کاملMultidimensional Mechanism Design for Auctions with Externalities
In an auction with externalities, a buyer's type is multidimensional and specifies the payoff he would get for each of the N+1 possible outcomes: the seller keeps the object or buyer i (i=1, ..., N) gets the object. We provide a characterization of multidimensional incentive compatible mechanisms similar to that for one-dimensional mechanisms. Although reservation utilities are endogenous and t...
متن کاملA Network Reliability Approach to Optimal Decomposition of Design Problems
This article addresses the problem of identifying the optimal decomposition of a design problem. Methods for solving decomposed mathematical programming problems require that an appropriate structure suitable for decomposition be identified. This first step consists of identifying linking (or coordinating) variables or functions that effect independent subproblems coordinated by a master proble...
متن کاملOptimal Online Algorithms for Multidimensional Packing Problems
We solve an open problem in the literature by providing an online algorithm for multidimensional bin packing that uses only bounded space. To achieve this, we introduce a new technique for classifying the items to be packed. We show that our algorithm is optimal among bounded space algorithms for any dimension d > 1. Its asymptotic performance ratio is (Π∞) , where Π∞ ≈ 1.691 is the asymptotic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Social Choice and Welfare
سال: 2021
ISSN: ['0176-1714', '1432-217X']
DOI: https://doi.org/10.1007/s00355-021-01349-4