Related papers: On explicit random-like tournaments
Mertens [In Proceedings of the International Congress of Mathematicians (Berkeley, Calif., 1986) (1987) 1528-1577 Amer. Math. Soc.] proposed two general conjectures about repeated games: the first one is that, in any two-person zero-sum…
This note replies Dr. Jensen (2010) comments on Problem 2.3, which was left in Fuh (2010). In the following, we use the same notations and definitions in Fuh (2006) unless specified.
In this note we extend a theorem from [13] about uniform circle random coverings
By randomly removing a fraction of levels from a given spectrum a model is constructed that describes a crossover from this spectrum to a Poisson spectrum. The formalism is applied to the transitions towards Poisson from random matrix…
Brandt et al. (2013) have recently disproved a conjecture by Schwartz (1990) by non-constructively showing the existence of a counterexample with about 10^136 alternatives. We provide a concrete counterexample for Schwartz's conjecture with…
We show that the existence of $\{\pm 1\}$-matrices having largest possible determinant is equivalent to the existence of certain tournament matrices. In particular, we prove a recent conjecture of Armario. We also show that large…
By reformulating a learning process of a set system L as a game between Teacher (presenter of data) and Learner (updater of the abstract independent set), we define the order type dim L of L to be the order type of the game tree. The theory…
In 1953, Kuhn showed that every sequential game has a Nash equilibrium by showing that a procedure, named ``backward induction'' in game theory, yields a Nash equilibrium. It actually yields Nash equilibria that define a proper subclass of…
We introduce a "high probability" framework for repeated games with incomplete information. In our non-equilibrium setting, players aim to guarantee a certain payoff with high probability, rather than in expected value. We provide a high…
Erd\H{o}s posed the question whether there exist infinitely many sets of consecutive numbers whose least common multiple (lcm) exceeds the lcm of another, larger set with greater consecutive numbers. In this paper, we answer this question…
The $t$-e.c. and pseudo-random property are typical properties of random graphs. In this note, we study the gap between them which has not been studied well. As a main result, we give the first explicit construction of infinite families of…
The paper reviews some axioms of additivity concerning ranking methods used for generalized tournaments with possible missing values and multiple comparisons. It is shown that one of the most natural properties, called consistency, has…
In this short note we provide a relatively simple proof of the Erd\H{o}s-Hajnal conjecture for families of finite (hyper-)graphs without the $k$-order property. It was originally proved by M. Malliaris and S. Shelah in "Regularity lemmas…
We examine a hierarchy of equivalence classes of quasi-random properties of Boolean Functions. In particular, we prove an equivalence between a number of properties including balanced influences, spectral discrepancy, local strong…
There seems to be an upper limit to predicting the outcome of matches in (semi-)professional sports. Recent work has proposed that this is due to chance and attempts have been made to simulate the distribution of win percentages to identify…
A tournament H is quasirandom-forcing if the following holds for every sequence (G_n) of tournaments of growing orders: if the density of H in G_n converges to the expected density of H in a random tournament, then (G_n) is quasirandom.…
The draw of some knockout tournaments requires finding a perfect matching in a balanced bipartite graph. The problem becomes challenging with draw constraints: the two draw procedures used in sports are known to be non-uniformly distributed…
Quasi-stationary distributions, as discussed by Darroch & Seneta (1965), have been used in biology to describe the steady state behaviour of population models which, while eventually certain to become extinct, nevertheless maintain an…
The concept of an evolutionarily stable strategy (ESS), introduced by Smith and Price, is a refinement of Nash equilibrium in 2-player symmetric games in order to explain counter-intuitive natural phenomena, whose existence is not…
We establish new couplings among several random graph and multigraph models related to the random regular graph $G(n,d)$, including the configuration model and unions of random perfect matchings. As a main result, we verify the…