相关论文: Games and Ramsey-like cardinals

We describe a framework for proving consistency results about singular cardinals of arbitrary cofinality and their successors. This framework allows the construction of models in which the Singular Cardinals Hypothesis fails at a singular…

We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive…

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…

Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of decomposing games that are strategically equivalent from a…

We present a general way of defining various reduction games on \omega\ which "represent" corresponding topologically defined classes of functions. In particular, we will show how to construct games for piecewise defined functions, for…

We give a characterizations of Ramsey ultrafilters on $\mathscr P(\omega)$ in terms of functions $f:\omega^n\to\omega$ and their ultrafilter extensions. To do this, we prove that for any partition $\mathcal P$ of $[\omega]^n$ there is a…

Driven by recent successes in two-player, zero-sum game solving and playing, artificial intelligence work on games has increasingly focused on algorithms that produce equilibrium-based strategies. However, this approach has been less…

The present paper introduces a novel notion of `(effective) computability', called viability, of strategies in game semantics in an intrinsic (i.e., without recourse to the standard Church-Turing computability), non-inductive and…

The game theoretic concepts of rationalizability and iterated dominance are closely related and provide characterizations of each other. Indeed, the equivalence between them implies that in a two player finite game, the remaining set of…

From a suitable large cardinal hypothesis, we provide a model with a supercompact cardinal in which universal indestructibility holds: every supercompact and partially supercompact cardinal kappa is fully indestructible by kappa-directed…

In this paper we introduce the $\Gamma$ value, a new value for cooperative games with transferable utility. We also provide an axiomatic characterization of the $\Gamma$ value based on a property concerning the so-called necessary players.…

We show that the notions of "strongly unfoldable cardinals", introduced by Villaveces in his model-theoretic studies of models of set theory, and "shrewd cardinals", introduced by Rathjen in a proof-theoretic context, coincide. We then…

Introducing unfoldable cardinals last year, Andres Villaveces ingeniously extended the notion of weak compactness to a larger context, thereby producing a large cardinal notion, unfoldability, with some of the feel and flavor of weak…

We will give an overview of four families of cardinal characteristics defined on subspaces $\prod_{\alpha\in\kappa}b(\alpha)$ of the generalised Baire space ${}^\kappa\kappa$, where $\kappa$ is strongly inaccessible and…

This paper is part II of a study on cardinals that are characterizable by a Scott sentence, continuing the work from http://arxiv.org/abs/1007.2426v1. A cardinal $\kappa$ is characterized by a Scott sentence $\phi_M$, if $\phi_M$ has a…

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…

Generalised indiscernibles highlight a strong link between model theory and structural Ramsey theory. In this paper, we use generalised indiscernibles as tools to prove results in both these areas. More precisely, we first show that a…

We show, assuming weak large cardinals, that in the context of games played in a proper class of moves, clopen determinacy is strictly weaker than open determinacy. The proof amounts to an analysis of a certain level of $L$ that exists…

For each natural number $n$, let $C^{(n)}$ be the closed and unbounded proper class of ordinals $\alpha$ such that $V_\alpha$ is a $\Sigma_n$ elementary substructure of $V$. We say that $\kappa$ is a \emph{$C^{(n)}$-cardinal} if it is the…

We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…