Related papers: Arhangelskii's $\alpha$-principles and selection g…
While generic competitive systems exhibit mixtures of hierarchy and cycles, real-world systems are predominantly hierarchical. We demonstrate and extend a mechanism for hierarchy; systems with similar agents approach perfect hierarchy in…
The aim of this work is to extend and prove the Onsager conjecture for a class of conservation laws that possess generalized entropy. One of the main findings of this work is the "universality" of the Onsager exponent, $\alpha > 1/3$,…
In what follows, essentially two things will be accomplished: Firstly, it will be proven that a version of the Arzel\`a--Ascoli theorem and the Fr\'echet--Kolmogorov theorem are equivalent to the axiom of countable choice for subsets of…
In this paper we define the closure under weak convergence of the class of p-tempered {\alpha}-stable distributions. We give necessary and sufficient conditions for convergence of sequences in this class. Moreover, we show that any element…
Evolutionary game theory classically investigates which behavioral patterns are evolutionarily successful in a single game. More recently, a number of contributions have studied the evolution of preferences instead: which subjective…
This paper uses category theory to develop an entirely new approach to approximate game theory. Game theory is the study of how different agents within a multi-agent system take decisions. At its core, game theory asks what an optimal…
Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…
An axiomatic characterization of Nash equilibrium is provided for games in normal form. The Nash equilibrium correspondence is shown to be fully characterized by four simple and intuitive axioms, two of which are inspired by contraction and…
Turner's Conjecture describes all blocks of symmetric groups and Hecke algebras up to derived equivalence in terms of certain double algebras. With a view towards a proof of this conjecture, we develop a general theory of Turner doubles. In…
For each element of certain families of integer sequences, we study the term-wise ratios of the Hankel transforms of three sequences related to that element by series reversion. In each case, the ratios define well-known sequences, and in…
What does it mean to fully understand the behavior of a network of adaptive agents? The golden standard typically is the behavior of learning dynamics in potential games, where many evolutionary dynamics, e.g., replicator, are known to…
We introduce the concept of Conversion/Preference Games, or CP games for short. CP games generalize the standard notion of strategic games. First we exemplify the use of CP games. Second we formally introduce and define the CP-games…
A serial property is a suitably enumerated sequence $\{F_n\}$ of formulas and is called selector provable in PA if there is a PA-recursive function $s(x)$ such that PA $\vdash \forall x (s(x){:}_{\text{PA}} \ulcorner F_x\urcorner)$ where…
This work contains the mathematical exploration of a few prototypical games in which central concepts from statistics and probability theory naturally emerge. The first two kinds of games are termed Fisher and Bayesian games, which are…
For numerical sequences taking values $0$ or complex numbers of modulus $1$, we define Chowla property and Sarnak property. We prove that Chowla property implies Sarnak property. We also prove that for Lebesgue almost every $\beta>1$, the…
We study the continuity properties of trajectories for some random series of functions $\sum a\_kf(\alpha X\_k(\omega))$ where $a\_k$ is a complex sequence, $X\_k$ a sequence of real independent random variables, $f$ is a real valued…
We prove axiomatic characterizations of several important multiwinner rules within the class of approval-based committee choice rules. These are voting rules that return a set of (fixed-size) committees. In particular, we provide axiomatic…
In a vintage paper concerning Parsimonious games, a subset of constant sum homogeneous weighted majority games, Isbell introduced a twin relationship based on transposition properties of the incidence matrices upon minimal winning…
We show that classical chaining bounds on the suprema of random processes in terms of entropy numbers can be systematically improved when the underlying set is convex: the entropy numbers need not be computed for the entire set, but only…
In a network game, players interact over a network and the utility of each player depends on his own action and on an aggregate of his neighbours' actions. Many real world networks of interest are asymmetric and involve a large number of…