The Experts below are selected from a list of 291 Experts worldwide ranked by ideXlab platform
Taraneh Tabatabai - One of the best experts on this subject based on the ideXlab platform.
-
How incentives matter? An illustration from the Targeted Subsidies reform in Iran
Social Choice and Welfare, 2019Co-Authors: Stéphane Gauthier, Taraneh TabatabaiAbstract:We use the Targeted Subsidies Reform implemented in Iran in 2011 to recover empirically the social valuations of Iranian households relying on the assumption of optimal consumption and income taxes, for welfarist and non-welfarist poverty alleviation social criteria. Unlike the existing literature, we do not Restrict Attention to a specific pattern for the incentive constraints implied by nonlinear income taxation. Instead we recover this pattern by estimating the Lagrange multipliers associated with the incentive constraints. Before the reform we find evidence of redistribution toward the bottom poor income deciles that is limited by an incentive constraint where the rich envy the social treatment of the poor. At the outcome of the reform incentives no longer matter and the social welfare function of the government of Iran displays a Benthamite-like form.
-
How incentives matter ? An illustration from the Targeted Subsidies reform in Iran
2017Co-Authors: Stéphane Gauthier, Taraneh TabatabaiAbstract:We use the Targeted Subsidies Reform implemented in Iran in 2011 to recover empirically the social valuations of Iranian households relying on the assumption of optimal taxes. Unlike the existing literature, we do not Restrict Attention to a specific pattern for the incentive constraints associated with nonlinear income taxation. Instead we recover the Lagrange multipliers corresponding to these constraints. We find evidence of a significant redistribution toward the bottom three deciles of the income distribution before the reform. This redistribution is however limited by an incentive constraint where the rich envy the social treatment of the poor. At the outcome of the reform incentives no longer matter and the social welfare function of the government of Iran displays a Benthamite-like form.
Stéphane Gauthier - One of the best experts on this subject based on the ideXlab platform.
-
How incentives matter? An illustration from the Targeted Subsidies reform in Iran
Social Choice and Welfare, 2019Co-Authors: Stéphane Gauthier, Taraneh TabatabaiAbstract:We use the Targeted Subsidies Reform implemented in Iran in 2011 to recover empirically the social valuations of Iranian households relying on the assumption of optimal consumption and income taxes, for welfarist and non-welfarist poverty alleviation social criteria. Unlike the existing literature, we do not Restrict Attention to a specific pattern for the incentive constraints implied by nonlinear income taxation. Instead we recover this pattern by estimating the Lagrange multipliers associated with the incentive constraints. Before the reform we find evidence of redistribution toward the bottom poor income deciles that is limited by an incentive constraint where the rich envy the social treatment of the poor. At the outcome of the reform incentives no longer matter and the social welfare function of the government of Iran displays a Benthamite-like form.
-
How incentives matter ? An illustration from the Targeted Subsidies reform in Iran
2017Co-Authors: Stéphane Gauthier, Taraneh TabatabaiAbstract:We use the Targeted Subsidies Reform implemented in Iran in 2011 to recover empirically the social valuations of Iranian households relying on the assumption of optimal taxes. Unlike the existing literature, we do not Restrict Attention to a specific pattern for the incentive constraints associated with nonlinear income taxation. Instead we recover the Lagrange multipliers corresponding to these constraints. We find evidence of a significant redistribution toward the bottom three deciles of the income distribution before the reform. This redistribution is however limited by an incentive constraint where the rich envy the social treatment of the poor. At the outcome of the reform incentives no longer matter and the social welfare function of the government of Iran displays a Benthamite-like form.
Paola Bruscoli - One of the best experts on this subject based on the ideXlab platform.
-
ICLP - A Purely Logical Account of Sequentiality in Proof Search
Logic Programming, 2002Co-Authors: Paola BruscoliAbstract:A strict correspondence between the proof-search space of a logical formal system and computations in a simple process algebra is established. Sequential composition in the process algebra corresponds to a logical relation in the formal system in this sense our approach is purely logical, no axioms or encodings are involved. The process algebra is a minimal Restriction of CCS to parallel and sequential composition; the logical system is a minimal extension of multiplicative linear logic. This way we get the first purely logical account of sequentiality in proof search. Since we Restrict Attention to a small but meaningful fragment, which is then of very broad interest, our techniques should become a common basis for several possible extensions. In particular, we argue about this work being the first step in a two-step research for capturing most of CCS in a purely logical fashion.
-
A purely logical account of sequentiality in proof search
Lecture Notes in Computer Science, 2002Co-Authors: Paola BruscoliAbstract:A strict correspondence between the proof-search space of a logical formal system and computations in a simple process algebra is established. Sequential composition in the process algebra corresponds to a logical relation in the formal system in this sense our approach is purely logical, no axioms or encodings are involved. The process algebra is a minimal Restriction of CCS to parallel and sequential composition; the logical system is a minimal extension of multiplicative linear logic. This way we get the first purely logical account of sequentiality in proof search. Since we Restrict Attention to a small but meaningful fragment, which is then of very broad interest, our techniques should become a common basis for several possible extensions. In particular, we argue about this work being the first step in a two-step research for capturing most of CCS in a purely logical fashion.
Matthew Zeng - One of the best experts on this subject based on the ideXlab platform.
-
Optimal stopping and the sufficiency of randomized threshold strategies
Electronic Communications in Probability, 2018Co-Authors: Vicky Henderson, David Hobson, Matthew ZengAbstract:In a classical optimal stopping problem the aim is to maximize the expected value of a functional of a diffusion evaluated at a stopping time. This note considers optimal stopping problems beyond this paradigm. We study problems in which the value associated to a stopping rule depends on the law of the stopped process. If this value is quasi-convex on the space of attainable laws then it is well known that it is sufficient to Restrict Attention to the class of threshold strategies. However, if the objective function is not quasi-convex, this may not be the case. We show that, nonetheless, it is sufficient to Restrict Attention to mixtures of threshold strategies.
-
Optimal Stopping and the Sufficiency of Randomized Threshold Strategies
arXiv: Probability, 2017Co-Authors: Vicky Henderson, David Hobson, Matthew ZengAbstract:In a classical optimal stopping problem the aim is to maximize the expected value of a functional of a diffusion evaluated at a stopping time. This note considers optimal stopping problems beyond this paradigm. We study problems in which the value associated to a stopping rule depends on the law of the stopped process. If this value is quasi-convex on the space of attainable laws then it is a well known result that it is sufficient to Restrict Attention to the class of threshold strategies. However, if the objective function is not quasi-convex, this may not be the case. We show that, nonetheless, it is sufficient to Restrict Attention to mixtures of threshold strategies.
M. Bhaskara Rao - One of the best experts on this subject based on the ideXlab platform.
-
On Stepwise Control of the Generalized Familywise Error Rate
Electronic Journal of Statistics, 2010Co-Authors: Wenge Guo, M. Bhaskara RaoAbstract:A classical approach for dealing with a multiple testing problem is to Restrict Attention to procedures that control the familywise error rate (FWER), the probability of at least one false rejection. In many applications, one might be willing to tolerate more than one false rejection provided the number of such cases is controlled, thereby increasing the ability of a procedure to detect false null hypotheses. This suggests replacing control of the FWER by controlling the probability of k or more false rejections, which is called the k-FWER. In this article, a unified approach is presented for deriving the k-FWER controlling procedures. We first generalize the well-known closure principle in the context of the FWER to the case of controlling the k-FWER. Then, we discuss how to derive the k-FWER controlling stepup procedures based on marginal p-values using this principle. We show that, under certain conditions, generalized closed testing procedures can be reduced to stepup procedures, and any stepup procedure is equivalent to a generalized closed testing procedure. Finally, we generalize the well-known Hommel procedure in two directions, and show that any generalized Hommel procedure is equivalent to a generalized closed testing procedure with the same critical values. AMS 2000 subject classifications: Primary 62J15; secondary 62G10.
-
On Stepwise Control of the Generalized Familywise Error Rate
arXiv: Statistics Theory, 2008Co-Authors: Wenge Guo, M. Bhaskara RaoAbstract:A classical approach for dealing with the multiple testing problem is to Restrict Attention to procedures that control the familywise error rate (FWER), the probability of at least one false rejection. In many applications, one might be willing to tolerate more than one false rejection provided the number of such cases is controlled, thereby increasing the ability of the procedure to detect false null hypotheses. This suggests replacing control of the FWER by controlling the probability of $k$ or more false rejections, which is called the $k$-FWER. In this article, a unified approach is presented for deriving the $k$-FWER controlling procedures. We first generalize the well-known closure principle in the context of the FWER to the case of controlling the $k$-FWER. Then, we discuss how to derive the $k$-FWER controlling stepwise (stepdown or stepup) procedures based on marginal $p$-values using this principle. We show that, under certain conditions, generalized closed testing procedures can be reduced to stepwise procedures, and any stepwise procedure is equivalent to a generalized closed testing procedure. Finally, we generalize the well-known Hommel procedure in two directions, and show that any generalized Hommel procedure is equivalent to a generalized closed testing procedure with the same critical values.
