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

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.

share|cite|improve this question

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

share|cite|improve this answer

Your Answer


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

Not the answer you're looking for? Browse other questions tagged or ask your own question.