Related papers: Game-theoretic variants of cardinal invariants
Given an ideal $I$ on $\omega$ let $a(I) $ ($\bar{a}(I)$) be minimum of the cardinalities of infinite (uncountable) maximal $I$-almost disjoint subsets of $[{\omega}]^{\omega}$, and denote $b_I$ and$d_I$ the unbounding and dominating…
The quasi-variational inequalities play a significant role in analyzing a wide range of real-world problems. However, these problems are more complicated to solve than variational inequalities as the constraint set is based on the current…
A large body of research is currently investigating on the connection between machine learning and game theory. In this work, game theory notions are injected into a preference learning framework. Specifically, a preference learning problem…
The Unique Games Conjecture (UGC) constitutes a highly dynamic subarea within computational complexity theory, intricately linked to the outstanding P versus NP problem. Despite multiple insightful results in the past few years, a proof for…
We study the determinacy of the game G_kappa (A) introduced in [FKSh:549] for uncountable regular kappa and several classes of partial orderings A. Among trees or Boolean algebras, we can always find an A such that G_kappa (A) is…
We study zero-sum games, a variant of the classical combinatorial Subtraction games (studied for example in the monumental work "Winning Ways", by Berlekamp, Conway and Guy), called Cumulative Subtraction (CS). Two players alternate in…
Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system…
We define and analyze the notion of variational Wardrop equilibrium for nonatomic aggregative games with an infinity of players types. These equilibria are characterized through an infinite-dimensional variational inequality. We show, under…
How many permutations of the natural numbers are needed so that every conditionally convergent series of real numbers can be rearranged to no longer converge to the same sum? We define the \emph{rearrangement number}, a new cardinal…
We offer some theorems, mainly of finiteness, for certain patterns in elliptical billiards, related to periodic trajectories. For instance, if two players hit a ball at a given position and with directions forming a fixed angle in…
We present a game semantics for intuitionistic type theory. Specifically, we propose categories with families of a new variant of games and strategies for both extensional and intensional variants of the type theory with dependent function,…
Our aim is to give for some classes non-additive measures some limit theorems. For balanced games we obtain a weak and strong law of large numbers for bounded random variables, a sharper conclusion is obtain with exact games. We provide an…
In this thesis new objects to the existing set of invariants of Lie algebras are added. These invariant characteristics are capable of describing the nilpotent parametric continuum of Lie algebras. The properties of these invariants, in…
We introduce a zero-sum game problem of mean-field type as an extension of the classical zero-sum Dynkin game problem to the case where the payoff processes might depend on the value of the game and its probability law. We establish…
We study incommensurate fractional variational problems in terms of a generalized fractional integral with Lagrangians depending on classical derivatives and generalized fractional integrals and derivatives. We obtain necessary optimality…
We study the values of the higher dimensional cardinal characteristics for sets of functions $f:\omega^\omega \to \omega^\omega$ introduced by the second author. We prove that while the bounding numbers for these cardinals can be strictly…
We study the value of unique games as a graph-theoretic parameter. This is obtained by labeling edges with permutations. We describe the classical value of a game as well as give a necessary and sufficient condition for the existence of an…
We characterize countable dimensionality and strong countable dimensionality by means of an infinite game.
Quantitative extensions of parity games have recently attracted significant interest. These extensions include parity games with energy and payoff conditions as well as finitary parity games and their generalization to parity games with…
This paper examines the convergence of no-regret learning in games with continuous action sets. For concreteness, we focus on learning via "dual averaging", a widely used class of no-regret learning schemes where players take small steps…