paulom

60

I appreciate this generalization of the results - I think it's a good step towards showing the underlying structure involved here.

One point I want to comment on is transitivity of , as a relation on induced functions . Namely, it isn't, and can even contain cycles of non-equivalent elements. (This came up when I was trying to apply a version of these results, and hoping that would be the preference relation I was looking for out of the box.) Quite possibly you noticed this since you give 'limited transitivity' in Lemma B.1 rather than full transitivity, but to give a concrete example:

Let
and . The permutations are with the usual action on . Then we have ^{[1]}
(and ). This also works on retargetability directly, with being , , retargetable. Notice also that is invariant under joint permutations (constant diagonals), and I think can be represented as EU-determined, so neither of these save it.

A narrow point is that for a non-transitive relation, I think the notation should be something other than (maybe ).

But more importantly, I think we would really rather a transitive (at least acyclic) relation, if we want to interpret this is 'most prefer' or any kind of preference / aggregation of preferences. If our theorem gives us only an intransitive relation as our conclusion, then we should tweak it.

One way you can do this: aim for a stronger relation like :

Definition (Orbit-mean dominance?): Let . Write if .

Since the orbits are under i.e. finite, it's easy to just sum over them. More generally, you could parameterize this with an arbitrary aggregator in place of summation; I'm not sure whether this general form or the case should be the focus.

This is transitive for and acyclic for^{[2]}
(consider by ); and possibly any orbit-based transitive relation is representable in basically this form^{[3]}
(with some ), since I'd guess any partial order on sets with cardinality can be represented as a pointwise inequality of functions, but I haven't thought about this too carefully.

With this notion of , we also need a stronger version of retargetability for the main theorem to hold. For the version, this could be

Definition (scalar-retargetability): Write is if there exists such that for all with we have (and likewise multiply scalar-retargetable).

Then scalar-retargetability from to will imply .

And: I think many (all?) of the main power-seeking results are already secretly in this form. For example, -wise comparison of gives a preference relation identical to the relation . Assuming this also works for the other rationalities, then the cases we care about were transitive all along exactly because the relations can be expressed in this way.

What do you think?

We get the same single orbit for all a.k.a. ; the orbit elements with are the columns where row row . There are always two such columns when comparing row and row (mod 3). For example, ↩︎

We exclude s.t. in this version of the definition to match the behaviour of with , and allow -scalar-retargetability to imply . There's a case that you

*should*include them, in which case you do get transitivity, and even the stronger property: if , then . I think this corresponds to looking at likelihood ratios of vs. . ↩︎Compare also what would give you a total order (instead of partial order): aggregating over all of at once, like , instead of aggregating orbitwise at each . ↩︎

Thanks for the reply. I'll clean this up into a standalone post and/or cover this in a related larger post I'm working on, depending on how some details turn out.

Variables I forgot to rename, when I changed how I was labelling the arguments of f in my example. This should be 12→2, 22→3, 32→1 retargetable (as arguments i to f(i|j)).