Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

A preference relation is of course a reflexive, total and transitive binary relation on a set, with the additional requirement that the agent be able to select one alternative from the set. I don't understand why this last requirement is needed?

In particular, I once heard from someone I consider much smarter than myself that for a player i in a normal form game, it doesn't really make sense to compare u_i(s) and u_i(t) for arbitrary strategy profiles s, t because player i can't necessarily deviate from s to t and vice versa.

But why wouldn't it make sense for players to assign preferences to the possible outcomes of a game, even though they don't directly get to choose amongst the outcomes, only contribute to it?


  1. If u_i(s) and u_i(t) are not in general comparable, how does it make sense to take linear combinations of these for expected utilities?

  2. Notions of equivalence then lose preservation of players preferences over Nash equilibria, which is relevant when considering equilibrium selection.

share|cite|improve this question

migrated from May 4 '12 at 4:36

This question came from our site for professional and academic economists and analysts.

Nick, could you elaborate on question 2? – Peteris Jan 19 '12 at 22:27
Arrow's definition of preference relation explicitly includes possibly impossible options (options that are sometimes possible, but sometimes not) and so he defined an "agenda" as a subset of the options (representing the options that are currently possible). – Jack Schmidt Sep 7 '12 at 13:44

A preference relation is just a relation on the set of choices. I think the Wikipedia explanation "among which a consumer can choose" was meant to clarify what the set represents not impose a formal restriction.

A rational preference relation, however, is also total and transitive. Note totality on $(x,x)$ implies $x \succeq x$ or $x \succeq x$, which is reflexivity.

I'm not sure about the remark about comparison. While it is true that you cannot deviate from one strategy profile to another mid-game (because your strategy profile completely specifies what to do after any combination of moves your opponent produces), you can still choose among different strategy profiles and mix them stochastically.

For example, a strategy profile $q$ could be defined that selects $s$ with probability $0.6$ and $t$ with probability $0.4$. This choice happens pre-game and requires no mid-game deviations. Then $$u_i(q)=0.6u_i(s)+0.4u_i(t).$$ Perhaps a strategy profile can be thought of as a way of reducing a sequential game to a single-move game where the payoff is the utility of the whole strategy profile.

I'm not sure I understand the question 2, perhaps you could clarify?

share|cite|improve this answer

The maximal elements of a preference relation are supposed to be the acts among which the agent will choose. If you add in a whole bunch of impossible options, it might well be that none of the maximal elements are feasible.

You can define a preference relation over a set that includes options like "Defect if and only if my opponent defects" and you can prefer them to the other options. But unless you can perform that action, then it is irrelevant. So I guess there's no theoretically strong ground for the restriction, but it seems reasonable in practice.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.