Dual Random Utility Maximisation
n?u=RePEc:san:wpecon:1605&r=upt
n?u=RePEc:san:wpecon:1605&r=upt
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
and ˆp (a, B ∪ {b}) = 1 2<br />
, so that in either case b impacts a in B.<br />
Observe that the only role performed by Impact Consistency in the proof is that it<br />
ensures, together with Modal Regularity that p is binary. So, we have immediately:<br />
Corollary 1 A stochastic choice rule is an mdRUM if and only if it is binary and satisfies<br />
Modal Regularity.<br />
It should be easy to check whether a p is binary, and in this sense being binary can<br />
serve as a good property for testing the model. However, Impact Consistency is behaviourally<br />
a more interesting property because it offers indications on the ‘comparative<br />
statics’ of the model across menus.<br />
We conclude this section with a few remarks.<br />
Remark 2 mdRUMs can accommodate violations of Weak Stochastic Transitivity as<br />
well as of Regularity. For example consider p given by p (a, {a, b}) = p (a, {a, b, c}) =<br />
p (b, {b, c}) = 2 3 , p (a, {a, c}) = 1 3<br />
= p (b, {a, b, c}). Then p violates Weak Stochastic<br />
Transitivity but it is an mdRUM generated by the rankings r 1 = acb and r 2 = bca with<br />
˜α ({a, b}) = ˜α ({a, b, c}) = 2 3 and ˜α ({b, c}) = ˜α ({a, c}) = 1 3 .<br />
Remark 3 The ordinal preference information contained in an mdRUM is entirely determined<br />
by which choice of alternative, in each menu, is possible, impossible or certain,<br />
not by the exact values of the choice probabilities. More precisely suppose that p<br />
is an mdRUM generated by (r 1 , r 2 , ˜α) and that p ′ is an mdRUM generated by (r ′ 1 , r′ 2 , ˜α′ ).<br />
If for all menus A, p (a, A) > 0 ⇔ p ′ (a, A) > 0, then it must be the case that r 1 = r ′ 1<br />
and r 2 = r<br />
2 ′ or r 2 = r<br />
1 ′ and r 1 = r<br />
2 ′ : that is, the rankings coincide up to a relabelling.<br />
The exact probabilities of choice in each menu then serve to determine the probabilities<br />
with which each ranking is maximised, but not to determine what those rankings look<br />
like.<br />
Remark 4 In an mdRUM, while the rankings can have arbitrarily small probability,<br />
they always have positive probability. This is crucial to tell apart the case in which<br />
the choice probability of an alternative a is zero because it is dominated by another<br />
alternative in both rankings, from the case in which a is dominated say in r 1 and top in<br />
r 2 , but r 2 occurs with zero probability in a given menu.<br />
27