How Heavy Is A Job?: A Critical Survey of Job Evaluation as a Payment Device.

With salaries subjected to scrutiny more than ever, it is increasingly important that the process by which they are determined be understood and justifiable. Both public and private organisations now routinely rely on so-called “job evaluation” as a means of constructing an appropriate pay-scale and as such it is ever more necessary that we appreciate how this system works and that we recognise its limits. Only with such an understanding of the way in which salaries are set can we hope to have a meaningful discussion of their economic function. This paper aims to expound the details of job evaluation both in theory and in practice, and critically assess its shortcomings. In Section 1 below we describe the job evaluation system and in Section 2 we briefly outline the history and the usage of the system in both the private and the public sector. In Section 3 we theoretically analyse the often unstated but nonetheless implicit assumptions made by practitioners of the art of job evaluation. Section 4 applies the analysis of Section 3 to review a particular and important case study, namely The Senior Salaries Review of the Welsh Assembly 2004. Section 5 concludes.

Nondictatorial Arrovian Social Welfare Functions: An Integer Programming Approach

In the line opened by Kalai and Muller (1997), we explore new conditions on prefernce domains which make it possible to avoid Arrow's impossibility result. In our main theorem, we provide a complete characterization of the domains admitting nondictorial Arrovian social welfare functions with ties (i.e. including indifference in the range) by introducing a notion of strict decomposability. In the proof, we use integer programming tools, following an approach first applied to social choice theory by Sethuraman, Teo and Vohra ((2003), (2006)). In order to obtain a representation of Arrovian social welfare functions whose range can include indifference, we generalize Sethuraman et al.'s work and specify integer programs in which variables are allowed to assume values in the set {0, 1/2, 1}: indeed, we show that, there exists a one-to-one correspondence between solutions of an integer program defined on this set and the set of all Arrovian social welfare functions - without restrictions on the range.

Integer Programming on Domains Containing Inseparable Ordered Paris

Using the integer programming approach introduced by Sethuraman, Teo, and Vohra (2003), we extend the analysis of the preference domains containing an inseparable ordered pair, initiated by Kalai and Ritz (1978). We show that these domains admit not only Arrovian social welfare functions \without ties," but also Arrovian social welfare functions \with ties," since they satisfy the strictly decomposability condition introduced by Busetto, Codognato, and Tonin (2012). Moreover, we go further in the comparison between Kalai and Ritz (1978)'s inseparability and Arrow (1963)'s single-peak restrictions, showing that the former condition is more \respectable," in the sense of Muller and Satterthwaite (1985).