Related papers: On Tournament Design
A tournament is $k$-spectrally monomorphic if all the $k\times k$ principal submatrices of its adjacency matrix have the same characteristic polynomial. Transitive $n$-tournaments are trivially $k$-spectrally monomorphic. We show that there…
Card games are widely used to study sequential decision-making under uncertainty, with real-world analogues in negotiation, finance, and cybersecurity. These games typically fall into three categories based on the flow of control: strictly…
A dessin d'enfant, or dessin, is a bicolored graph embedded into a Riemann surface, and the monodromy group is an algebraic invariant of the dessin generated by rotations of edges about black and white vertices. A rational billiards surface…
This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource management is given, and the respective computational properties of each…
We study statistics of the knockout tournament, where only the winner of a fixture progresses to the next. We assign a real number called competitiveness to each contestant and find that the resulting distribution of prize money follows a…
We show that the class of all finite regular tournaments is cofinal in the class of finite tournaments. In addition, we establish cofinality results for certain special subclasses of regular tournaments. We also provide an algorithm for…
This manuscript was written for the Proceedings of the ICRA 2022 in Buenos Aires. It can be divided into four parts: The first part is an introduction to the theory of monomorphism categories, including a short survey on some representation…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…
As an alternative view to the graph formation models in the statistical physics community, we introduce graph formation models using \textit{network formation} through selfish competition as an approach to modeling graphs with particular…
We investigate multi-round team competitions between two teams, where each team selects one of its players simultaneously in each round and each player can play at most once. The competition defines an extensive-form game with perfect…
We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…
We extend the open games framework for compositional game theory to encompass also mixed strategies, making essential use of the discrete probability distribution monad. We show that the resulting games form a symmetric monoidal category,…
Given an ideal I in a polynomial ring, we consider the largest monomial subideal contained in I, denoted mono(I). We study mono as an interesting operation in its own right, guided by questions that arise from comparing the Betti tables of…
Often, a given selection game studied in the literature has a known dual game. In dual games, a winning strategy for a player in either game may be used to create a winning strategy for the opponent in the dual. For example, the Rothberger…
Compositional Game Theory is a new, recently introduced model of economic games based upon the computer science idea of compositionality. In it, complex and irregular games can be built up from smaller and simpler games, and the equilibria…
We describe a round robin scheduling problem for a competition played in two divisions, motivated by a scheduling problem brought to the second author by a local sports organisation. The first division has teams from 2n clubs, and is played…
A $d$-distinguishing vertex (arc) labeling of a digraph is a vertex (arc) labeling using $d$ labels that is not preserved by any nontrivial automorphism. Let $\rho(T)$ ($\rho'(T)$) be the minimum size of a label class in a 2-distinguishing…
The article is devoted to microbundles over topological rings. Their structure, homomorphisms, automorphisms and extensions are studied. Moreover, compactifications and inverse spectra of microbundles over topological rings are…
The monograph is concerned with some key problems of the theory of nonlinear economic dynamics. The authors' concept consists in analyzing the problem of structural instability of economic systems within the framework of the synergetic…
The clique number of a tournament is the maximum clique number of a graph formed by keeping backwards arcs in an ordering of its vertices. We study the time complexity of computing the clique number of a tournament and prove that, for any…