When does a random Robin Hood win?

Author： Gasarch W. Golub E. Srinivasan A.

Publisher： Elsevier

ISSN： 0304-3975

Source： Theoretical Computer Science, Vol.304, Iss.1, 2003-07, pp. : 477-484

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

e-Honesty: when does it pay?

By Lyudyno Georgiy Sarangi Sudipta

Netnomics, Vol. 6, Iss. 3, 2004-12 ,pp. : 209-219

Springer Publishing Company

Access to resources Recommend Favorite

Spin-the-Bottle Sort and Annealing Sort: Oblivious Sorting via Round-Robin Random Comparisons

By Goodrich Michael

Algorithmica, Vol. 68, Iss. 4, 2014-04 ,pp. : 835-858

Springer Publishing Company

Access to resources Recommend Favorite

Stochastic programming: Potential hazards when random variables reflect market interaction

By Haugen Kjetil

Annals of Operations Research, Vol. 142, Iss. 1, 2006-02 ,pp. : 119-127

Springer Publishing Company

Access to resources Recommend Favorite

Tail Asymptotics for the Supremum of a Random Walk when the Mean Is not Finite

By Denisov Denis Foss Serguei Korshunov Dima

Queueing Systems, Vol. 46, Iss. 1-2, 2004-01 ,pp. : 15-33

Springer Publishing Company

Access to resources Recommend Favorite

Choosing either the best or the second best when the number of applicants is random

By Kawai M. Tamaki M.

Computers and Mathematics with Applications, Vol. 46, Iss. 7, 2003-10 ,pp. : 1065-1071

Elsevier

Access to resources Recommend Favorite