An Empirical Examination of the Impacts from Termination of a Performance-Based Incentive Plan

This paper reports on the financial impacts from the termination of a pay for performance plan for the salesforce at a retail establishment. Using monthly panel data spanning more than eight years for 15 outlets of a major retailer, this study documents that store-level sales and operating profits decrease after the incentive plan is terminated. Individual performance data are then investigated to help identify the role of effort and selection effects in explaining the documented decrease. The analysis of the individual employee sales data reveals that virtually all of the declining store level sales can be explained by selection effects.

Improving retail banking staff incentive systems

This Work Project seeks to analyze the viability, utility and best way of implementing mechanisms of double accounting and of insertion of low (or null) sales objectives in an incentives program. The main findings are that both processes are possible and to a certain extent advisable, although in very specific ways and with some limitations. Double accounting processes are especially effective between different segments and networks and should have a greater impact in the first evaluation periods of each case and the null objectives, albeit usable, are recommended to be always substituted by positive objectives, even if quite small. Moreover, it is concluded that the formal structure of the incentives program influences significantly these concepts, namely concerning the duration of the evaluation periods and the interaction of the objectives of different entities for both the vertical (hierarchic) and horizontal (individual and collective) levels.

Sharing the Cost of a Public Good: an Incentive-Constrained Axiomatic Approach

We study the problem of provision and cost-sharing of a public good in large economies where exclusion, complete or partial, is possible. We search for incentive-constrained efficient allocation rules that display fairness properties. Population monotonicity says that an increase in population should not be detrimental to anyone. Demand monotonicity states that an increase in the demand for the public good (in the sense of a first-order stochastic dominance shift in the distribution of preferences) should not be detrimental to any agent whose preferences remain unchanged. Under suitable domain restrictions, there exists a unique incentive-constrained efficient and demand-monotonic allocation rule: the so-called serial rule. In the binary public good case, the serial rule is also the only incentive-constrained efficient and population-monotonic rule.

(Minimally) 'epsilon'-incentive compatible competitive equilibria in economies with indivisibilities

We consider competitive and budget-balanced allocation rules for problems where a number of indivisible objects and a fixed amount of money is allocated among a group of agents. In 'small' economies, we identify under classical preferences each agent's maximal gain from manipulation. Using this result we find the competitive and budget-balanced allocation rules which are minimally manipulable for each preference profile in terms of any agent's maximal gain. If preferences are quasi-linear, then we can find a competitive and budget-balanced allocation rule such that for any problem, the maximal utility gain from manipulation is equalized among all agents.

Continuity and Incentive Compatibility in Cardinal Voting Mechanisms

We show that every cardinal incentive compatible voting mechanism satisfying a continuity condition, must be ordinal. Our results apply to many standard models in mechanism design without transfers, including the standard voting models with any domain restrictions.

Ordinally consistent tournament solutions

A set ranking method assigns to each tournament on a given set an ordering of the subsets of that set. Such a method is consistent if (i) the items in the set are ranked in the same order as the sets of items they beat and (ii) the ordering of the items fully determines the ordering of the sets of items. We describe two consistent set ranking methods.