Minimize the Expected Rank

Three items arrive in random order; after each you learn its rank relative to those seen so far and must accept or reject irrevocably (the last is forced). Instead of trying to get the single best, you want to minimize the expected absolute rank of the item you finally accept (rank 1 = best, rank 3 = worst). Find the optimal policy and the minimum achievable expected rank.