First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
In many settings the power of truthful mechanisms is severely bounded. In this paper we use randomization to overcome this problem. In particular, we construct an FPTAS for multi-...
An extended algorithm of the relative reward strength algorithm is proposed. It is shown that the proposed algorithm ensures the convergence with probability 1 to the optimal path ...
A useful theorem of Kuˇcera states that given a Martin-L¨of random infinite binary sequence ω and an effectively open set A of measure less than 1, some tail of ω is not in A...
Laurent Bienvenu, Adam R. Day, Ilya Mezhirov, Alex...