Related papers: Universal gaps for XOR games from estimates on ten…
This article establishes a rigorous spectral framework for the mathematical analysis of SHAP values. We show that any predictive model defined on a discrete or multi-valued input space admits a generalized Fourier expansion with respect to…
Recent results showed it was possible to determine if a modest size 3XOR game has a perfect quantum strategy. We build on these and give an explicit polynomial time algorithm which constructs such a perfect strategy or refutes its…
We investigate variants of Marstrand's projection theorem that hold for sets of directions and classes of sets in $\mathbb{R}^2$. We say that a set of directions $D \subseteq\mathcal{S}^1$ is $\textit{universal}$ for a class of sets if, for…
The purpose of this article is to show that an intrinsic noise with values in the space ${\mathcal P}({\mathbb R})$ of $1d$ probability measures may force uniqueness to first order mean field games. The structure of the noise is inspired…
We study the problem of optimizing a graph-structured objective function under \emph{adversarial} uncertainty. This problem can be modeled as a two-persons zero-sum game between an Engineer and Nature. The Engineer controls a subset of the…
We study projective functions. We prove that projective functions generalise lower and upper-semianalytic ones while being stable by composition and difference. We show that the class of projective functions is closed under sums,…
The projection constant $\Pi(E):=\Pi(E, \ell_\infty)$ of a finite-dimensional Banach space $E\subset\ell_\infty$ is by definition the smallest norm of a linear projection of $\ell_\infty$ onto $E$. Fix $n\geq 1$ and denote by $\Pi_n$ the…
A theory is universal contextual if its prediction cannot be reproduced by an ontological model satisfying both preparation and measurement noncontextuality assumptions. In this report, we first generalize the logical proofs of quantum…
In this paper we generalize the classical Noether-Lefschetz Theorem to arbitrary smooth projective threefolds. Let $X$ be a smooth projective threefold over complex numbers, $L$ a very ample line bundle on $X$. Then we prove that there is a…
We study unique games and estimate some of their values. We prove that if a unique game has a quantum-assisted value close to 1, then it must have a perfect deterministic strategy. We introduce a family of unique games based on groups that…
We consider certain large random matrices, called random inner-product kernel matrices, which are essentially given by a nonlinear function $f$ applied entrywise to a sample-covariance matrix, $f(X^TX)$, where $X \in \mathbb{R}^{d \times…
Prediction is a well-studied machine learning task, and prediction algorithms are core ingredients in online products and services. Despite their centrality in the competition between online companies who offer prediction-based products,…
In this paper, we consider a class of $n$-person noncooperative games, where the utility function of every player is given by a homogeneous polynomial defined by the payoff tensor of that player, which is a natural extension of the bimatrix…
We establish a relation between the "large r" asymptotics of the Turaev-Viro invariants $TV_r$ and the Gromov norm of 3-manifolds. We show that for any orientable, compact 3-manifold $M$, with (possibly empty) toroidal boundary, $\log |TV_r…
Evolutionary game theory has been an important tool for describing economic and social behaviour for decades. Approximate mean value equations describing the time evolution of strategy concentrations can be derived from the players'…
We study minority games in efficient regime. By incorporating the utility function and aggregating agents with similar strategies we develop an effective mesoscale notion of state of the game. Using this approach, the game can be…
Given $N\ge2$ closed subspaces $M_1,\dotsc, M_N$ of a Hilbert space $X$, let $P_k$ denote the orthogonal projection onto $M_k$, $1\le k\le N$. It is known that the sequence $(x_n)$, defined recursively by $x_0=x$ and $x_{n+1}=P_N\cdots…
We introduce a strategy to tackle some known obstructions of current approaches to the Fourier uniformity conjecture. Assuming GRH, we then show the conjecture holds for intervals of length at least $(\log X)^{\psi(X)}$, with $\psi(X)…
A popular quantitative approach to evaluating player performance in sports involves comparing an observed outcome to the expected outcome ignoring player involvement, which is estimated using statistical or machine learning methods. In…
Programs that combine I/O and countable probabilistic choice, modulo either bisimilarity or trace equivalence, can be seen as describing a probabilistic strategy. For well-founded programs, we might expect to axiomatize bisimilarity via a…