Multi-valued strategy-proof social choice rules

In this paper we introduce a new definition of strategy-proofness for multi-valued social choice correspondences. We prove two Gibbard-Satterthwaite type results for strategy-proof social choice correspondences. These results show that allowing multiple outcomes as social choices will not necessarily lead to an escape from the Gibbard-Satterthwaite impossibility theorem. Received: 24 January 2001/Accepted: 19 March 2001     

A critical evaluation of the commodification thesis

A recurring theme across the social sciences is that non‐capitalist production is disappearing albeit slowly and unevenly, and is being replaced by a commodified economy in which goods and services are produced by capitalist firms for a profit under conditions of market exchange. In this paper, however, I evaluate critically this commodification thesis. Even in the heartland of commoditisation ‐ the advanced economies. Large economic spaces are identified where alternative economic relations and motives prevail. Rather than view them as leftovers of pre‐capitalist formations, this paper argues that they are the result of both the contradictions inherent in the structural shifts associated with the pursuit of commodification as well as the existence of‘cultures of resistance’, As such, they are viewed as 'spaces of hope’which highlight the demonstrable construction and practice of alternative social relations and logic's of work outside profit‐motivated market‐oriented exchange.     

Generating random variates from D-distributions via substitution sampling

Laud et al. (1993) describe a method for random variate generation from D-distributions. In this paper an alternative method using substitution sampling is given. An algorithm for the random variate generation from SD-distributions is also given.     

Optimal orthogonal-array-based latin hypercubes

The use of optimal orthogonal array latin hypercube designs is proposed. Orthogonal arrays were proposed for constructing latin hypercube designs by Tang (1993). Such designs generally have better space filling properties than random latin hypercube designs. Even so, these designs do not necessarily fill the space particularly well. As a result, we consider orthogonal-array-based latin hypercube designs that try to achieve optimality in some sense. Optimization is performed by adapting strategies found in Morris & Mitchell (1995) and Ye et al. (2000). The strategies here search only orthogonal-array-based latin hypercube designs and, as a result, optimal designs are found in a more efficient fashion. The designs found are in general agreement with existing optimal designs reported elsewhere.