1
$\begingroup$

Inspired by a comment on this question.

Assume that I have an algorithm which uses ordinally scaled data. The algorithm in the original question was the solution of the Secretary Problem. It uses the ordinal data to maximize something.

Is there a heuristic which tells me how likely it is that the feeding the algorithm with the same data in reverse will deliver a result which minimizes something? Which criteria are a sign that this won't work?

Also, is the answer different for interval or ratio scaled data?

I will also accept an answer which says "there are too many possible criteria to find a meaningful heuristic", if this is the case.

$\endgroup$

1 Answer 1

1
$\begingroup$

I would see 2 necessary conditions:

  1. there is no test on the order in the algorithm
  2. The result do depend on the order of the input (do not return the sum of the values...)

I'd be surprised if it were sufficient

$\endgroup$

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .