
hervé moulin 375
r
the set R contains all possible “welfare functions.” Such a function takes into
account all relevant components of an individual welfare, such as preferences,
values, aspirations, but also tastes and needs, endowments of talents and skills,
disabilities, etc. One possible representation of individual welfare is as a utility
function, associating to each possible endstate (each element of X)anumerical
measure of welfare. Here we adopt the more general “ordinal” description of
welfare as a preference ordering of X:eachelementR of
R is a binary relation
comparing pairs of endstates (deciding which of any two endstates gives the
higher welfare level), but refraining from associating a cardinal measure to each
endstate. Thus
R is the set of all possible welfare orderings R.Theadvantages
of the ordinal approach over the cardinal one are well known (see for instance
Mas-Colell, Whinstone, and Green 1990).
r
the game form G describing individual rights, and their interaction. It consists
of a set M
i
of actions among which agent i freely chooses one element m
i
,anda
mapping f from M
1
×...× M
n
into X, specifying which endstate z results for
each profile (m
1
,...,m
n
) of individual actions. The notation m
i
reminds us that
the action often consists of sending a message. When this message is a report of
agent i’s preference ordering R
i
,wespeakofadirect game form.
The model (N, X, R, G) encompasses many familiar examples. Voting is the sim-
plest one. The set of voters is N,andX is an arbitrary finite set of candidates. Prefer-
ences over X are only restricted by the standard rationality postulates of transitivity
and completeness (see Mas-Colell, Whinston, and Green 1990). In plurality voting,
each voter writes the name of a single candidate on his ballot, thus the set of actions—
in this case messages—available to voter i is the set of candidates, that is M
i
= X.The
candidate with the largest number of votes is elected, which defines unambiguously
(except for the tie-breaking rule) the mapping of G from profiles of ballots into X.
More complicated voting rules such as the Borda Count require a much larger set
of actions M
i
; here each voter reports his entire preference ordering of X, therefore
M
i
= R. Multistage voting rules (such as voting by successive eliminations) give rise
to even bigger and more complex action spaces, because the participants are involved
in a multiperiod strategic game.
The Divide and Choose mechanism is another simple illustration of our general
model. The set X describes all possible divisions of a given “cake” between two agents,
N = {1, 2}. The preference ordering R
i
compares all shares of the cake from the point
of view of agent i. Besides the postulates of transitivity and completeness, further
restrictions may apply, for instance it is natural to assume that a larger piece of cake
is always desirable. The agent with the role of Divider, say agent 1, must choose a
division of the cake in two pieces, therefore M
1
= X. The Chooser, on the other hand,
can only pick one of the two pieces cut by the Divider, therefore M
2
specifies which
piece is chosen from every possible division left by the Divider.
It should be clear from the above examples that the model (N, X,
R, G)encom-
passes a huge variety of applications from market mechanisms to political processes