This paper provides characterization theorems for preferences that can be represented by the minimum, the maximum, and the sum of components, or combinations of these forms. It contains a discussion of applications to social choice.

This paper assumes that in addition to the conventional (selfish) preferences over outcomes, players in a strategic environment have preferences over strategies. In the context of two-player games, it provides conditions under which a player's preferences over strategies can be represented as a...

This paper provides characterization theorems for preferences. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss applications of our results to social...

Each member of a group receives a signal about the unknown state of the world and decides upon a utility-maximizing recommendation on the basis of that signal. The individuals have identical preferences. The group makes a decision that maximizes the common utility function assuming perfect...

This paper extends Milgrom and Robert's treatment of supermodular games in two ways. It points out that their main characterization result holds under a weaker assumption. It refines the arguments to provide bounds on the set of strategies that survive iterated deletion of weakly dominated...

This paper shows that in some axioms regarding the mixture of random variables, the requirement that the conclusions hold for all values of the mixture parameter can be weakened by requiring the existence of only one nontrivial value of the parameter, which need not be fixed. This is the case...

Each member of a group receives a signal about the unknown state of the world and decides upon a utility-maximizing recommendation on the basis of that signal. The individuals have identical preferences. The group makes a decision that maximizes the common utility function assuming perfect...

This paper extends Milgrom and Robert's treatment of supermodular games in two ways. It points out that their main characterization result holds under a weaker assumption. It refines the arguments to provide bounds on the set of strategies that survive iterated deletion of weakly dominated...

Given n agents with von Neumann-Morgenstern utility functions who wish to divide m commodities, consider the n-person noncooperative game with strategies consisting of concave, increasing von Neumann-Morgenstern utility functions, and whose outcomes are the relative utilitarian solution. It is...