%0 Conference Paper
%1 Kumar:2015:IS:2684822.2685310
%A Kumar, Ravi
%A Tomkins, Andrew
%A Vassilvitskii, Sergei
%A Vee, Erik
%B Proceedings of the Eighth ACM International Conference on Web Search and Data Mining
%C New York, NY, USA
%D 2015
%I ACM
%K markov state steady toread
%P 359--368
%T Inverting a Steady-State
%U http://doi.acm.org/10.1145/2684822.2685310
%X We consider the problem of inferring choices made by users based only on aggregate data containing the relative popularity of each item. We propose a framework that models the problem as that of inferring a Markov chain given a stationary distribution. Formally, we are given a graph and a target steady-state distribution on its nodes. We are also give a mapping from per-node scores to a transition matrix, from a broad family of such mappings. The goal is to set the scores of each node such that the resulting transition matrix induces the desired steady state. We prove sufficient conditions under which this problem is feasible and, for the feasible instances, obtain a simple algorithm for a generic version of the problem. This iterative algorithm provably finds the unique solution to this problem and has a polynomial rate of convergence; in practice we find that the algorithm converges after fewer than ten iterations. We then apply this framework to choice problems in online settings and show that our algorithm is able to explain the observed data and predict the user choices much better than other competing baselines across a variety of diverse datasets.