The effect of firm-level contracts on the structure of wages: evidence from matched employer-employee data

Revised: 2006-11

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

23 p. -- An extended abstract of this work appears in the proceedings of the 2012 ACM/IEEE Symposium on Logic in Computer Science

Managing and resisting ‘degeneration’ in employee-owned businesses: a comparative study of two large retailers in Spain and the UK

Employee-owned businesses have recently enjoyed a resurgence of interest as possible ‘alternatives’ to the somewhat tarnished image of conventional investor-owned capitalist firms. Within the context of global economic crisis, such alternatives seem newly attractive. This is somewhat ironic because, for more than a century, academic literature on employee-owned businesses has been dominated by the ‘degeneration thesis’. This suggested that these businesses tend towards failure – they either fail commercially, or they relinquish their democratic characters. Bucking this trend and offering a beacon - especially in the UK - has been the commercially successful, co-owned enterprise of the John Lewis Partnership (JLP) whose virtues have seemingly been rewarded with favourable and sustainable outcomes. This paper makes comparisons between JLP and its Spanish equivalent Eroski – the supermarket group which is part of the Mondragon cooperatives. The contribution of this paper is to examine in a comparative way how the managers in JLP and Eroski have constructed and accomplished their alternative scenarios. Using longitudinal data and detailed interviews with senior managers in both enterprises it explores the ways in which two large, employee-owned, enterprises reconcile apparently conflicting principles and objectives. The paper thus puts some new flesh on the ‘regeneration thesis’.

Beyond Q-Resolution and Prenex Form: a Proof System for Quantified Constraint Satisfaction

We consider the quanti fied constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quanti fication, whether or not the sentence is true on the structure. We present a proof system for certifying the falsity of QCSP instances and develop its basic theory; for instance, we provide an algorithmic interpretation of its behavior. Our proof system places the established Q-resolution proof system in a broader context, and also allows us to derive QCSP tractability results.