Related papers: Kramnik vs Nakamura: A Chess Scandal
Pairwise comparison is an important tool in multi-attribute decision making. Pairwise comparison matrices (PCM) have been applied for ranking criteria and for scoring alternatives according to a given criterion. Our paper presents a special…
A tournament on a graph is an orientation of its edges. The score sequence lists the in-degrees in non-decreasing order. Works by Winston and Kleitman (1983) and Kim and Pittel (2000) showed that the number $S_n$ of score sequences on the…
We study competitive diffusion games on graphs introduced by Alon et al. [1] to model the spread of influence in social networks. Extending results of Roshanbin [8] for two players, we investigate the existence of pure Nash equilibria for…
In this paper it is demonstrated that the scoring at each PGA Tour stroke play event can be reasonably modeled as a Gaussian random variable. All 46 stroke play events in the 2007 season are analyzed. The distributions of scores are…
Here we perform a statistical analysis of the official data from recent Russian parliamentary and presidential elections (held on December 4th, 2011 and March 4th, 2012, respectively). A number of anomalies are identified that persistently…
This paper considers repeated games in which one player has more information about the game than the other players. In particular, we investigate repeated two-player zero-sum games where only the column player knows the payoff matrix A of…
We consider the stability of matchings when individuals strategically submit preference information to a publicly known algorithm. Most pure Nash equilibria of the ensuing game yield a matching that is unstable with respect to the…
We study Maker/Breaker games on the edges of the complete graph, as introduced by Chvatal and Erdos. We show that in the (m:b) clique game played on K_{N}, the complete graph on N vertices, Maker can achieve a K_{q} for q = (m/(log_{2}(b +…
The integrity of democratic elections depends on voters' access to accurate information. However, modern media environments, which are dominated by social media, provide malicious actors with unprecedented ability to manipulate elections…
We propose some new results on the comparison of the minimum or maximum order statistic from a random number of non-identical random variables. Under the non-identical set-up, with certain conditions, we prove that random minimum (maximum)…
The reproducibility of academic research has long been a persistent issue, contradicting one of the fundamental principles of science. What is even more concerning is the increasing number of false claims found in academic manuscripts…
Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example where this conjecture remains open is when $H=K_{5,5}\setminus…
Among the sports fans beliefs about "hot hands" and "winning streaks" are widely spread, while the scientific debate about these effects is still ongoing. Recently in a paper by P. Ferreira [Physica A 500: 92-96] detrended fluctuation…
Assume that letters (from a finite alphabet) in a text form a Markov chain. We track two distinct words, $U$ and $D$. A gambler gains 1 point for each occurrence of $U$ (including overlapping occurrences) and loses 1 point for each…
We consider all matches played by professional tennis players between 1968 and 2010, and, on the basis of this data set, construct a directed and weighted network of contacts. The resulting graph shows complex features, typical of many real…
Since cheating is obviously wrong, arguments against it (it provides an unfair advantage, it hinders learning) need only be mentioned in passing. But the argument of unfair advantage absurdly takes education to be essentially a race of all…
Games with incomplete preferences are an important model for studying rational decision-making in scenarios where players face incomplete information about their preferences and must contend with incomparable outcomes. We study the problem…
We study the effects of randomness on competitions based on an elementary random process in which there is a finite probability that a weaker team upsets a stronger team. We apply this model to sports leagues and sports tournaments, and…
Given a fixed graph $H$ with at least two edges and positive integers $n$ and $b$, the strict $(1 \colon b)$ Avoider-Enforcer $H$-game, played on the edge set of $K_n$, has the following rules: In each turn Avoider picks exactly one edge,…
Predicting the outcome of sports events is a hard task. We quantify this difficulty with a coefficient that measures the distance between the observed final results of sports leagues and idealized perfectly balanced competitions in terms of…