Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • Parallel matching for ranking all teams in a tournament

  • Part of
  • Kei Kobayashi, Hideki Kawasaki, Akimichi Takemura
  • Journal:
    Advances in Applied Probability / Volume 38 / Issue 3 / September 2006
    Published online by Cambridge University Press:
    01 July 2016, pp. 804-826
    Print publication:
    September 2006
    • Article
      • You have access
    • PDF
    • Export citation

  • We propose a simple and efficient scheme for ranking all teams in a tournament where matches can be played simultaneously. We show that the distribution of the number of rounds of the proposed scheme can be derived using lattice path counting techniques used in ballot problems. We also discuss our method from the viewpoint of parallel sorting algorithms.

  • An absorption probability for the Ornstein-Uhlenbeck process

  • John P. Dirkse
  • Journal:
    Journal of Applied Probability / Volume 12 / Issue 3 / September 1975
    Published online by Cambridge University Press:
    14 July 2016, pp. 595-599
    Print publication:
    September 1975

  • An asymptotic expression for an absorption probability for the Ornstein-Uhlenbeck process is presented along with an application of the result to a problem in optional stopping. The relation of this result to the asymptotic behavior of a weighted Kolmogorov-Smirnov statistic is also discussed. Sweet and Hardin (1970) derive an exact solution (not in closed form) for this same problem.