相关论文: On explicit random-like tournaments
We present an extensive statistical analysis of the results of all sports competitions in five major sports leagues in England and the United States. We characterize the parity among teams by the variance in the winning fraction from…
We explore a mechanism of decision-making in Mean Field Games with myopic players. At each instant, agents set a strategy which optimizes their expected future cost by assuming their environment as immutable. As the system evolves, the…
In this paper we present a new proof of a proposition presented in the article: Complexes of tournaments, directionality filtrations and persistent homology. This paper is part of Joaqu\'in Casta\~neda's undergraduate thesis.
We prove a variant of the abstract probabilistic version of Szemer\'edi's regularity lemma, due to Tao, which applies to a number of structures (including graphs, hypergraphs, hypercubes, graphons, and many more) and works for random…
The online semi-random graph process is a one-player game which starts with the empty graph on $n$ vertices. At every round, a player (called Builder) is presented with a vertex $v$ chosen uniformly at random and independently from previous…
An equivalent directed version of the celebrated unresolved conjecture of Erdos and Hajnal proposed by Alon, Pack, and Solymosi states that for every tournament H there exists epsilon(H)>0 such that every H-free n-vertex tournament T…
Seymour's Second Neighborhood Conjecture (SSNC) asserts that every oriented finite simple graph (without digons) has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood. Such a vertex is said to have…
The Parrondo effect describes the seemingly paradoxical situation in which two losing games can, when combined, become winning [Phys. Rev. Lett. 85, 24 (2000)]. Here we generalize this analysis to the case where both games are…
In this paper we introduce and study a certain type of sub semi-group of $\mathbb{R}/\mathbb{Z}$ which turns out to be closely related to \sz's theorem on arithmetic progressions.
In this paper, we defined two new games - the mildly Menger game and the compact-clopen game. In a zero-dimensional space, the Menger game is equivalent to the mildly Menger game and the compact-open game is equivalent to the compact-clopen…
In this paper we consider the issue of a unique prediction in one to one two sided matching markets, as defined by Gale and Shapley (1962), and we prove the following. Theorem. Let P be a one-to-one two-sided matching market and let P be…
The celebrated Erd\"{o}s-Hajnal conjecture states that for every undirected graph $H$ there exists $ \epsilon(H) > 0 $ such that every undirected graph on $ n $ vertices that does not contain $H$ as an induced subgraph contains a clique or…
This paper is inspired from the nice result of Andrew Hassell on the eigenfunctions in the stadium billiard. From a classical paper of V. Arnol'd, we know that quasi-modes are not always close to exact modes. We show that, for almost all…
We give a short proof of a recent result of Claesson, Dukes, Frankl\'in and Stef\'ansson, connecting the number $S_n$ of score sequences and the Erd\H{o}s-Ginzburg-Ziv numbers $N_n$ from additive number theory. Our proof utilizes the…
Equilibrium predictions in games of incomplete information are sensitive to the assumed information structure. Monderer and Samet (1996) and Kajii and Morris (1998) define topological notions of proximity for common prior information…
For every fixed graph $H$ and every fixed $0 < \alpha < 1$, we show that if a graph $G$ has the property that all subsets of size $\alpha n$ contain the ``correct'' number of copies of $H$ one would expect to find in the random graph…
The concept of biased Maker-Breaker games, introduced by Chv\'atal and Erd{\H o}s, is a central topic in the field of positional games, with deep connections to the theory of random structures. For any given hypergraph ${\cal H}$ the main…
Crucial to an Evolutionary Algorithm's performance is its selection scheme. We mathematically investigate the relation between polynomial rank and probabilistic tournament methods which are (respectively) generalisations of the popular…
We form a "map of tournaments" by adapting the map framework from the world of elections. By a tournament we mean a complete directed graph where the nodes are the players and an edge points from a winner of a game to the loser (with no…
The drawbacks in the formulations of random infinite divisibility in Sandhya (1991, 1996), Gnedenko and Korelev (1996), Klebanov and Rachev (1996), Bunge (1996) and Kozubowski and Panorska (1996) are pointed out. For any given Laplace…