A social welfare function for a denumerable society satisfies {Pairwise Computability} if for each pair (x, y) of alternatives, there exists an algorithm that can decide from any description of each profile on {x,y} whether the society prefers x to y. I prove that if a social welfare function...

This paper contains a model of waste elimination through design. It argues for the importance of managing design complexity in improving cost, quality, variety, and time--to--market performance variables. Management of design complexity is identified with creation, choice, and application of...

The paper demonstrates the effects that the largely ignored, phenomenon of subsistence farming can have on agricultural development in countries in transition. The problem of subsistence consists of the different economic behaviour of subsistence farms compared to commercial ones. The paper...

This paper suggests a reason, other than asymmetric information, why agency contracts are not explicitly contingent on the agent's performance or actions. Two ingredients are essential to this reason. The first is the written form that contracts are required to take to be enforceable. The second...

For infinite societies, Fishburn (1970), Kirman and Sondermann (1972), and Armstrong (1980) gave a nonconstructive proof of the existence of a social welfare function satisfying Arrowfs conditions (Unanimity, Independence, and Nondictatorship). This paper improves on their results by (i) giving...

This paper contains a model of waste elimination through design. It argues for the importance of managing design complexity in improving cost, quality, variety, and time--to--market performance variables. Management of design complexity is identified with creation, choice, and application of...

This article presents a model of the structure of the information flows that underlie the creation of production chains between thousands of small textile firms located in Prato, central Italy. Contrary to most textile industry of western Europe and north America, Prato did not die out once...

This paper investigates algorithmic computability of simple games (voting games). It shows that (i) games with a finite carrier are computable, (ii) computable games have both finite winning coalitions and cofinite losing coalitions, and (iii) computable games violate any conceivable notion of...