相关论文: Ideal games and Ramsey sets

Given a graph $G$ and a collection $\mathcal C$ of subsets of $\mathbb{R}^d$ indexed by the subsets of vertices of $G$, a constrained drawing of $G$ is a drawing, where each edge is drawn inside some set from $\mathcal C$, in such a way…

We introduce several homotopy equivalence relations for proper holomorphic mappings between balls. We provide examples showing that the degree of a rational proper mapping between balls (in positive codimension) is not a homotopy invariant.…

We study general-sum, multi-player stochastic games with transferable utility, motivated by settings where agents can use side payments to make cooperation individually rational. Building on the Harsanyi--Shapley (HS) value for normal-form…

This paper studies the rationalization and identification of binary games where players have correlated private types. Allowing for correlation is crucial in global games and in models with social interactions as it represents correlated…

In this article, we continue the studying of $\mathcal{H}_Y$-ideals. We introducing two notions fixed and free $\mathcal{H}_Y$-ideals as an extension of fixed and free z-ideals in C(X) and relative $\mathcal{H}_Y$-ideals as an extension of…

We state the Ramsey property of classes of ordered structures with closures and given local properties. This generalises many old and new results: the Ne\v{s}et\v{r}il-R\"{o}dl Theorem, the author's Ramsey lift of bowtie-free graphs as well…

Let G be a connected linear algebraic group over an algebraically closed field k, and let H be a connected closed subgroup of G. We prove that the homogeneous variety G/H is a rational variety over k whenever H is solvable, or when dim(G/H)…

Many learning algorithms are known to converge to an equilibrium for specific classes of games if the same learning algorithm is adopted by all agents. However, when the agents are self-interested, a natural question is whether agents have…

We develop a theory of real numbers as rational Cauchy sequences, in which any two of them, $(a_n)$ and $(b_n)$, are equal iff $\lim\,(a_n-b_n)=0$. We need such reals in the Countable Mathematical Analysis ([4]) which allows to use only…

Ramsey's theorem asserts that every $k$-coloring of $[\omega]^n$ admits an infinite monochromatic set. Whenever $n \geq 3$, there exists a computable $k$-coloring of $[\omega]^n$ whose solutions compute the halting set. On the other hand,…

$S$ equilibrium synthesizes a century of game-theoretic modeling. $S$-beliefs determine choices as in the refinement literature and level-$k$, without anchoring on Nash equilibrium or imposing ad hoc belief formation. $S$-choices allow for…

We study the dependence of graded Betti numbers of monomial ideals on the characteristic of the base field. The examples we describe include bipartite ideals, Stanley--Reisner ideals of vertex-decomposable complexes and ideals with…

A characterization of an $h$-hemiregular hemiring in terms of a fuzzy $h$-ideal is provided. Some properties of prime fuzzy $h$-ideals of $h$-hemiregular hemirings are investigated. It is proved that a fuzzy subset $\zeta$ of a hemiring $S$…

Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In this work, we highlight the connection between this…

For a monomial ideal $I$, we consider the $i$th homological shift ideal of $I$, denoted by $\text{HS}_i(I)$, that is, the ideal generated by the $i$th multigraded shifts of $I$. Some algebraic properties of this ideal are studied. It is…

We extend the study of learning in games to dynamics that exhibit non-asymptotic stability. We do so through the notion of uniform stability, which is concerned with equilibria of individually utility-seeking dynamics. Perhaps surprisingly,…

Given a metric space $X$, we consider certain families of functions $f:X\to\mathbb{R}$ having the hereditary oscillation property HSOP and the hereditary continuous restriction property HCRP on large sets. When $X$ is Polish, among them…

We study the computational complexity of decision problems about Nash equilibria in $m$-player games. Several such problems have recently been shown to be computationally equivalent to the decision problem for the existential theory of the…

This paper introduces a new solution concept for non-cooperative games in normal form with no ties and pure strategies: the Perfectly Transparent Equilibrium. The players are rational in all possible worlds and know each other's strategies…

The class of passable games was recently introduced by Selinger as a class of combinatorial games that are suitable for modelling monotone set coloring games such as Hex. In a monotone set coloring game, the players alternately color the…