Sheldon Ross

Sheldon Ross


Research Focus & Metrics

Academic Career Length

37Years (1990-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2010 in Probability in the Engineering and Informational Sciences
Verified
Journal Article
Closed access
PDF file
MBMark Brown
Mark Brown
EPErol A. Peköz
Erol A. Peköz
SRSheldon Ross
Sheldon Ross
A random walk that is skip-free to the left can only move down one level at a time but can skip up several levels. Such random walk features prominently in many places in applied probability including queuing theory and the theory of branching processes. This article exploits the special structure in this class of random walk to obtain a number of simplified derivations for results that are much more difficult in general cases. Although some of the results in this article have appeared elsewhere, our proof approach is different.

1 September 2005 in Journal of Applied Probability
Verified
Journal Article
Closed access
SRSheldon Ross
Sheldon Ross
JSJ. George Shanthikumar
J. George Shanthikumar
ZZZegang Zhu
Zegang Zhu
We provide sufficient conditions for the following types of random variable to have the increasing-failure-rate (IFR) property: sums of a random number of random variables; the time at which a Markov chain crosses a random threshold; the time until a random number of events have occurred in an inhomogeneous Poisson process; and the number of events of a renewal process, and of a general counting process, that have occurred by a randomly distributed time.

19 March 2008 in Probability in the Engineering and Informational Sciences
Verified
Journal Article
Closed access
PDF file
MBMark Brown
Mark Brown
EPErol A. Peköz
Erol A. Peköz
SRSheldon Ross
Sheldon Ross
We consider the classical coupon collector's problem in which each new coupon collected is type i with probability pi; ∑i=1npi=1. We derive some formulas concerning N, the number of coupons needed to have a complete set of at least one of each type, that are computationally useful when n is not too large. We also present efficient simulation procedures for determining P(N > k), as well as analytic bounds for this probability.

1 September 2005 in Journal of Applied Probability
Verified
Journal Article
Closed access
PDF file
SRSheldon Ross
Sheldon Ross
JSJ. George Shanthikumar
J. George Shanthikumar
ZZZegang Zhu
Zegang Zhu
We provide sufficient conditions for the following types of random variable to have the increasing-failure-rate (IFR) property: sums of a random number of random variables; the time at which a Markov chain crosses a random threshold; the time until a random number of events have occurred in an inhomogeneous Poisson process; and the number of events of a renewal process, and of a general counting process, that have occurred by a randomly distributed time.

2 July 2021 in Probability in the Engineering and Informational Sciences
Verified
Journal Article
Closed access
PDF file
SRSheldon Ross
Sheldon Ross
We consider a competition involving $r$ teams, where each individual game involves two teams, and where each game between teams $i$ and $j$ is won by $i$ with probability $P_{i,j} = 1 - P_{j,i}$ . We suppose that $i$ and $j$ are scheduled to play $n(i,j)$ games and say that the team that wins the most games is the winner of the competition. We show that the conditional probability that $i$ is the winner, given that $i$ wins $k$ games, is increasing in $k$ . We bound the tail probability of the number of wins of the winning team. We consider the special case where $P_{i,j} = {v_i}/{(v_i + v_j)}$ , and obtain structural results on the probability that team $i$ is the winner. We give efficient simulation approaches for computing the probability that team $i$ is the winner, and the conditional probability given the number of wins of $i$ .

1 March 2008 in Journal of Applied Probability
Verified
Journal Article
Closed access
SRSheldon Ross
Sheldon Ross
ZZZegang Zhu
Zegang Zhu
Consider a sales contract, called a swing contract, between a seller and a buyer concerning some underlying commodity, with the contract specifying that during some future time interval the buyer will purchase an amount of the commodity between some specified minimum and maximum values. The purchase price and capacity at each time point is also prespecified in the contract. Assuming a random market price process and ignoring the possibility of storage, we look for the maximal expected net gain for the buyer of such a contract, and the strategy that achieves this maximal expected net gain. We study the effects that various contract constraints and market price processes have on the optimal strategy and on the contract value. We show how we can reduce the general swing contract to a multiple exercising of American (Bermudan) style options. Also, in important special cases, we give explicit expressions for the optimal contract value function and the optimal strategy.