4 citations · 5 across the 19 of their papers we have counts for
13 papers · 1 filter
Distinct Extreme Scores in Random Round-Robin Tournaments
Yaakov Malinovsky
We consider a general round-robin tournament model with equally strong players, where denotes the score of player against player . We assume that takes val…
Extreme Score Distributions in Countable-Outcome Round-Robin Tournaments of Equally Strong Players
Yaakov Malinovsky
We consider a general class of round-robin tournament models of equally strong players. In these models, each of the players competes against every other player exactly once. F…
Maximal Counts in the Stopped Occupancy Problem
Alexander Gnedin, Svante Janson, Yaakov Malinovsky
We revisit a version of the classic occupancy scheme, where balls are thrown until almost all boxes receive a given number of balls. Special cases are widely known as coupon-collec…
A Note on a Recent Conjecture in Mathematics Magazine
Yaakov Malinovsky
In this note, we establish the validity of a conjecture recently proposed in Mathematics Magazine and connect it to the existing interesting results
Hitting k primes by dice rolls
Noga Alon, Yaakov Malinovsky, Lucy Martinez +1
Let be an infinite sequence of rolls of independent fair dice. For an integer , let be the smallest so that there are inte…
Uniqueness of Maximum Scores in Countable-Outcome Round-Robin Tournaments
Gideon Amir, Yaakov Malinovsky
In this note, we extend a recent result on the uniqueness of the maximum score in a classical round-robin tournament to general round-robin tournament models with equally strong pl…
Optimal single threshold stopping rules and sharp prophet inequalities
Alexander Goldenshluger, Yaakov Malinovsky, Assaf Zeevi
This paper considers a finite horizon optimal stopping problem for a sequence of independent and identically distributed random variables, where the objective is to design stopping…
Hitting a prime in 2.43 dice rolls (on average)
Noga Alon, Yaakov Malinovsky
What is the number of rolls of fair 6-sided dice until the first time the total sum of all rolls is a prime? We compute the expectation and the variance of this random variable up…
On Tournaments and Negative Dependence
Yaakov Malinovsky, Yosef Rinott
Negative dependence of sequences of random variables is often an interesting characteristic of their distribution, as well as a useful tool for studying various asymptotic results,…
On the distribution of winners' scores in a round-robin tournament
Yaakov Malinovsky
In a classical chess round-robin tournament, each of players wins, draws, or loses a game against each of the other players. A win rewards a player with 1 points, a draw…
On negative dependence inequalities and maximal scores in round-robin tournaments
Yaakov Malinovsky, John W. Moon
We extend Huber's (1963) inequality for the joint distribution function of negative dependent scores in round-robin tournaments. As a byproduct, this extension implies convergence…
Stochastic precedence and minima among dependent variables
Emilio De Santis, Yaakov Malinovsky, Fabio Spizzichino
The notion of stochastic precedence between two random variables emerges as a relevant concept in several fields of applied probability. When one consider a vector of random variab…
A Unified Approach for Solving Sequential Selection Problems
Alexander Goldenshluger, Yaakov Malinovsky, Assaf Zeevi
In this paper we develop a unified approach for solving a wide class of sequential selection problems. This class includes, but is not limited to, selection problems with no-inform…