Related papers: Sprague-Grundy theory in bounded arithmetic
We provide some examples showing how game-theoretic arguments can be used in computability theory and algorithmic information theory: unique numbering theorem (Friedberg), the gap between conditional complexity and total conditional…
We present a computational formulation for the approximate version of several variational inequality problems, investigating their computational complexity and establishing PPAD-completeness. Examining applications in computational game…
Incorporating constraints is a major concern in probabilistic machine learning. A wide variety of problems require predictions to be integrated with reasoning about constraints, from modelling routes on maps to approving loan predictions.…
We study multiplayer quantitative reachability games played on a finite directed graph, where the objective of each player is to reach his target set of vertices as quickly as possible. Instead of the well-known notion of Nash equilibrium…
A value of a CSP instance is typically defined as a fraction of constraints that can be simultaneously met. We propose an alternative definition of a value of an instance and show that, for purely combinatorial reasons, a value of an…
We study Riemannian manifolds with boundary under a lower Bakry-E'mery Ricci curvature bound. In our weighted setting, we prove several rigidity theorems for such manifolds with boundary. We conclude a rigidity theorem for the inscribed…
We study the computational complexity of distance games, a class of combinatorial games played on graphs. A move consists of colouring an uncoloured vertex subject to it not being at certain distances determined by two sets, D and S. D is…
In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and…
Motivated by conjectures of Demailly, Green-Griffiths, Lang, and Vojta, we show that several notions related to hyperbolicity behave similarly in families. We apply our results to show the persistence of arithmetic hyperbolicity along field…
The Shapley value is arguably the most central normative solution concept in cooperative game theory. It specifies a unique way in which the reward from cooperation can be "fairly" divided among players. While it has a wide range of real…
Effects of boundary conditions of fields for compactified space directions on the supersymmetric gauge theories are discussed. For general and possible boundary conditions the supersymmetry is explicitly broken to yield universal soft…
This PhD deals with the notion of pseudo algebraically closed (PAC) extensions of fields. It develops a group-theoretic machinery, based on a generalization of embedding problems, to study these extensions. Perhaps the main result is that…
In this paper we show some multiplicity estimates theorems for a connected algebraic group (not necessarily commutative) $G$ over an algebraically closed subfield of $\mathbb{C}$. More specifically, under particular assumptions on the…
We investigate the possibility that stringy nonperturbative effects appear as holes in the world-sheet. We focus on the case of Dirichlet string theory, which we argue should be formulated differently than in previous work, and we find that…
We investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters…
Degree bounds for algebra generators of invariant rings are a topic of longstanding interest in invariant theory. We study the analogous question for field generators for the field of rational invariants of a representation of a finite…
We introduce a graceful approach to probabilistic inference called bounded conditioning. Bounded conditioning monotonically refines the bounds on posterior probabilities in a belief network with computation, and converges on final…
Generalized Geography is a combinatorial game played on a directed graph. Players take turns moving a token from vertex to vertex, deleting a vertex after moving the token away from it. A player unable to move loses. It is well known that…
In 2010, Bre\v{s}ar, Klav\v{z}ar and Rall introduced the optimization variant of the graph domination game and the game domination number, which was proved PSPACE-hard by Bre\v{s}ar et al. in 2016. In 2024, Leo Versteegen obtained the…
The main motivation for this article is to explore the connections between the existence of certain combinatorial patterns (as in van der Corputs's theorem on arithmetic progressions of length $3$) with well-known tools and theorems for…