Related papers: The NPA hierarchy does not always attain the commu…
We consider a routing game among non-atomic agents where link latency functions are conditional on an uncertain state of the network. The agents have the same prior belief about the state, but only a fixed fraction receive private route…
This article contains a characterization of operator systems $\cS$ with the property that every positive map $\phi:\cS \rightarrow M_n$ is decomposable, as well as an alternate and a more direct proof of a characterization of decomposable…
We consider the reachability problem for higher-order functional programs and study the relationship between reachability games (i.e., the reachability problem for programs with angelic and demonic nondeterminism) and may-reachability…
Classic no-trade theorems attribute trade to heterogeneous beliefs. We re-examine this conclusion for AI agents, asking if trade can arise from computational limitations, under common beliefs. We model agents' bounded computational…
We study the computational power of randomized computations on infinite objects, such as real numbers. In particular, we introduce the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a…
We provide an existence result for stationary fractional mean field game systems, with fractional exponent greater than 1/2. In the case in which the coupling is a nonlocal regularizing potential, we obtain existence of solutions under…
The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the…
The Price of Anarchy (PoA) is a well-established game-theoretic concept to shed light on coordination issues arising in open distributed systems. Leaving agents to selfishly optimize comes with the risk of ending up in sub-optimal states…
We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to…
The Hanoi Omega-Automata (HOA) format has established itself as the definitive standard for encoding $\omega$-regular automata in modern synthesis tools. While HOA is widely adopted due to its succinct symbolic representation, using Boolean…
We study the problem of deciding the winner of reachability switching games for zero-, one-, and two-player variants. Switching games provide a deterministic analogue of stochastic games. We show that the zero-player case is NL-hard, the…
We compare complex networks built from the game of go and obtained from databases of human-played games with those obtained from computer-played games. Our investigations show that statistical features of the human-based networks and the…
The computable cross norm (CCN) criterion is a new powerful analytical and computable separability criterion for bipartite quantum states, that is also known to systematically detect bound entanglement. In certain aspects this criterion…
Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…
We consider the model of history-deterministic one-counter nets (OCNs). History-determinism is a property of transition systems that allows for a limited kind of non-determinism which can be resolved 'on-the-fly'. Token games, which have…
I shall argue that a resolution of the PvNP problem requires building an iff bridge between the domain of provability and that of computability. The former concerns how a human intelligence decides the truth of number-theoretic relations,…
We consider the maximal operator with respect to uncentered cubes on Euclidean space with arbitrary dimension. We prove that for any function with bounded variation, the variation of its maximal function is bounded by the variation of the…
Bounded-rate multi-mode systems (BMMS) are hybrid systems that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent rates that can vary within given…
We study two-player \emph{take-away} games whose outcomes emulate two-state one-dimensional cellular automata, such as Wolfram's rules 60 and 110. Given an initial string consisting of a central data pattern and periodic left and right…
We study a class of zero-sum stochastic games between a stopper and a singular-controller, previously considered in [Bovo and De Angelis (2025)]. The underlying singularly-controlled dynamics takes values in…