Related papers: On a game theoretic cardinality bound
We discuss two general aspects of the theory of cardinal characteristics of the continuum, especially of proofs of inequalities between such characteristics. The first aspect is to express the essential content of these proofs in a way that…
In this work, we present a logic based on first-order CTL, namely Game Analysis Logic (GAL), in order to reason about games. We relate models and solution concepts of Game Theory as models and formulas of GAL, respectively. Precisely, we…
We determine the consistency strength of determinacy for projective games of length $\omega^2$. Our main theorem is that $\boldsymbol\Pi^1_{n+1}$-determinacy for games of length $\omega^2$ implies the existence of a model of set theory with…
The aim of this paper is to present necessary and sufficient conditions for generalized H\"{o}lder's inequality on generalized Morrey spaces. We also obtain similar results on weak Morrey spaces and on generalized weak Morrey spaces. The…
This work studies Nash equilibria for games where a mixture of coordinating and anti-coordinating agents, with possibly heterogeneous thresholds, coexist and interact through an all-to-all network. Whilst games with only coordinating or…
This brief note views to the Welch bound inequality using the idea of the kernel trick from the machine learning research area. From this angle, some novel insights of the inequality are obtained.
We consider differentiable games where the goal is to find a Nash equilibrium. The machine learning community has recently started using variants of the gradient method (GD). Prime examples are extragradient (EG), the optimistic gradient…
This paper presents a new mathematical formalism that describes the quantization of games. The study of so-called quantum games is quite new, arising from a seminal paper of D. Meyer \cite{Meyer} published in Physics Review Letters in 1999.…
In this paper, we have established boundaries of cardinal numbers of nonempty sets in finite non-$T_1$ topological spaces using interval analysis. For a finite set with known cardinality, we give interval estimations based on the closure…
Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…
The growing use of machine learning models in consequential settings has highlighted an important and seemingly irreconcilable tension between transparency and vulnerability to gaming. While this has sparked sizable debate in legal…
Often, a given selection game studied in the literature has a known dual game. In dual games, a winning strategy for a player in either game may be used to create a winning strategy for the opponent in the dual. For example, the Rothberger…
We consider an extension of a noncooperative game problem where players have joint binding constraints. In this case, justification of a generalized equilibrium point needs a reasonable mechanism for attaining this state. We suggest to…
We introduce a set-valued solution concept, M equilibrium, to capture empirical regularities from over half a century of game-theory experiments. We show M equilibrium serves as a meta theory for various models that hitherto were considered…
The class of d-setting, d-outcome Bell inequalities proposed by Ji and collaborators [Phys. Rev. A 78, 052103] are reexamined. For every positive integer d > 2, we show that the corresponding non-trivial Bell inequality for probabilities…
For a topological space $X$, let $X_\delta$ be the space $X$ with $G_\delta$-topology of $X$. For an uncountable cardinal $\kappa$, we prove that the following are equivalent: (1) $\kappa$ is $\omega_1$-strongly compact. (2) For every…
While it is known that shared quantum entanglement can offer improved solutions to a number of purely cooperative tasks for groups of remote agents, controversy remains regarding the legitimacy of quantum games in a competitive setting--in…
We provide game-theoretic proofs of some well-known existence theorems of Friedberg numberings for the class of all partial computable functions, including (1) the existence of two incomparable Friedberg numberings; (2) the existence of a…
The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…