When using long ranking choice data to estimate the random regret minimization model, based on the mean bias and root mean squared error of the estimator, we find that the rank-ordered random regret minimization model has advantages over the multinomial logit model and the standard random regret ...
Stochastic Rank-One Bandits are a simple framework for regret minimization problems over rank-one matrices of arms. The initially proposed algorithms are proved to have logarithmic regret, but do not match the existing lower bound for this problem. We close this gap by first proving that rank-...