A “brer rabbit” case for reverse mandated benefits

Reverse mandated benefits is a government-mandated policy that requires employees to provide their employers with benefits that workers would not provide otherwise. Of course, only those benefits would be mandated that are worth more to employers than they cost, as determined by political authorities. My case for such a policy argues that it is at least as sensible as policies mandating that employers provide benefits to their employees that would not be provided otherwise.     

India’s Social Development in a Decade of Reforms: 1990–91/1999–2000

The economic reforms initiated in India in 1991 have brought about visible upliftment of economic conditions of the country. This paper examines if the economic process is associated with an enhancement of India’s social development in equal measure in the reform decade of nineties. Ray (1989) considered thirteen social indicators of India and constructed the country’s social development index (SDI) as a certain weighted average of the selected indicators, for the years between 1950–51 and 1975–76. The present work broadly follows Ray (1989) in tracking the social development in the decade of economic reforms from 1990–91 to 1999–2000. The movement of SDI in nineties has been compared with the movements of India’s per capita income and plan expenditure on the social sector. The results show that though there has been growth in the social sector, it is not by far quite encouraging and perhaps more needs to be done in the social sector. The views expressed in the article are those of the author and not of the institution he serves.     

Intertemporal choice under timing risk: An experimental approach

This paper investigates how individuals evaluate delayed outcomes with risky realization times. Under the discounted expected utility (DEU) model, such evaluations depend only on intertemporal preferences. We obtain several testable hypotheses using the DEU model as a benchmark and test these hypotheses in three experiments. In general, our results show that the DEU model is a poor predictor of intertemporal choice behavior under timing risk. We found that individuals are averse to timing risk and that they evaluate timing lotteries in a rank-dependent fashion. The main driver of timing risk aversion is nothing but probabilistic risk aversion that stems from the nonlinear treatment of probabilities.     

On the computation of the noncentral <Emphasis Type="Italic">F</Emphasis> and noncentral beta distribution

Unfortunately many of the numerous algorithms for computing the comulative distribution function (cdf) and noncentrality parameter of the noncentral F and beta distributions can produce completely incorrect results as demonstrated in the paper by examples. Existing algorithms are scrutinized and those parts that involve numerical difficulties are identified. As a result, a pseudo code is presented in which all the known numerical problems are resolved. This pseudo code can be easily implemented in programming language C or FORTRAN without understanding the complicated mathematical background. Symbolic evaluation of a finite and closed formula is proposed to compute exact cdf values. This approach makes it possible to check quickly and reliably the values returned by professional statistical packages over an extraordinarily wide parameter range without any programming knowledge. This research was motivated by the fact that a very useful table for calculating the size of detectable effects for ANOVA tables contains suspect values in the region of large noncentrality parameter values compared to the values obtained by Patnaik’s 2-moment central-F approximation. The cause is identified and the corrected form of the table for ANOVA purposes is given. The accuracy of the approximations to the noncentral-F distribution is also discussed. The authors wish to thank Mr. Richárd Király for his preliminary work. The authors are grateful to the Editor and Associate Editor of STCO and the unknown reviewers for their helpful suggestions.     

Beheimatungsprozesse begleiten — ein Werkstattbericht

Supporting processes of belonging in supervision and coachingThe contemporary employee has to cope with frequent changes. Not only does he lose his familiar environment, he also has to find ways to familiarize himself with new places and to develop a fresh sense of belonging. This process can be understood and facilitated by interpreting the German concept of “Heimat“ as something we have to create ourselves. First experiences demonstrate the usefulness of this approach in coaching processes.     

Expected sample moments of concomitants of selected order statistics

In this paper, the task of determining expected values of sample moments, where the sample members have been selected based on noisy information, is considered. This task is a recurring problem in the theory of evolution strategies. Exact expressions for expected values of sums of products of concomitants of selected order statistics are derived. Then, using Edgeworth and Cornish-Fisher approximations, explicit results that depend on coefficients that can be determined numerically are obtained. While the results are exact only for normal populations, it is shown experimentally that including skewness and kurtosis in the calculations can yield greatly improved results for other distributions.     

Basic aspects of evolution strategies

Evolution strategies (ESs) are a special class of probabilistic, direct, global optimization methods. They are similar to genetic algorithms but work in continuous spaces and have the additional capability of self-adapting their major strategy parameters. This paper presents the most important features of ESs, namely their self-adaptation, as well as their robustness and potential for parallelization which they share with other evolutionary algorithms.Besides the early (1 + 1)-ES and its underlying theoretical results, the modern ( + )-ES and (, )-ES are presented with special emphasis on the self-adaptation of strategy parameters, a mechanism which enables the algorithm to evolve not only the object variables but also the characteristics of the probability distributions of normally distributed mutations. The self-adaptation property of the algorithm is also illustrated by an experimental example.The robustness of ESs is demonstrated for noisy fitness evaluations and by its application to discrete optimization problems, namely the travelling salesman problem (TSP).Finally, the paper concludes by summarizing existing work and general possibilities regarding the parallelization of evolution strategies and evolutionary algorithms in general.     

Going to Pieces: Paul Monette and the Fragments of the Tribe

Author of the highly acclaimed Borrowed Time: An AIDS Memoir (1988) and winner of the 1992 National Book Award for his autobiography Becoming a Man: Half a Life Story, Paul Monette died of complications from AIDS in Los Angeles on February 12, 1995. His most recent work, Last Watch of the Night: Essays Too Personal and Otherwise (1994), is his third volume in a trilogy of autobiographical writing on growing up gay, coming-out, and living with AIDS. A graduate of Phillips Academy and Yale University, Monette received a number of awards for his writing and his work as an outspoken voice in the battle against AIDS, including the National Book Award, three Lambda Literary awards, the PEN Center West Freedom to Write Award, and three honorary doctorate degrees, from Wesleyan University, the City University of New York, and the State University of New York at Oswego. A memorial service was held for Monette on Sunday, February 19, 1995, at the Directors Guild of America on Sunset Boulevard in Los Angeles. Paul Monette was 49.     

Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem

In the binary single constraint Knapsack Problem, denoted KP, we are given a knapsack of fixed capacity c and a set of n items. Each item j, j = 1,...,n, has an associated size or weight w_j and a profit p_j. The goal is to determine whether or not item j, j = 1,...,n, should be included in the knapsack. The objective is to maximize the total profit without exceeding the capacity c of the knapsack. In this paper, we study the sensitivity of the optimum of the KP to perturbations of either the profit or the weight of an item. We give approximate and exact interval limits for both cases (profit and weight) and propose several polynomial time algorithms able to reach these interval limits. The performance of the proposed algorithms are evaluated on a large number of problem instances.