We construct coverings which unravel given Π11 sets. This in turn is used to prove, from optimal large cardinal assumptions, the determinacy of games with payoff and the determinacy of games with payoff in the σ algebra generated by Π11 sets.

We characterize, in terms of determinacy, the existence of the least inner model of "every object of type k has a sharp." For k ∈ ω, we define two classes of sets, (Π 0 k ) * and (Π 0 k ) * + , which lie strictly between $\bigcup_{\beta and Δ(ω 2 -Π 1 1 ). Let ♯ k be the (partial) sharp function on objects of type k. We show that the determinancy of (Π 0 k ) * (...) follows from $L \lbrack\ sharp_k \rbrack \models "\text{every object of type} k \text{has a sharp},$ and we show that the existence of indiscernibles for L[ ♯ k ] is equivalent to a slightly stronger determinacy hypothesis, the determinacy of (Π 0 k ) * +. (shrink)

This paper introduces the real core model K() and determines the extent of scales in this inner model. K() is an analog of Dodd-Jensen's core model K and contains L(), the smallest inner model of ZF containing the reals R. We define iterable real premice and show that Σ1∩() has the scale property when vR AD. We then prove the following Main Theorem: ZF + AD + V = K() DC. Thus, we obtain the Corollary: If ZF + AD +()L() (...) is consistent, then ZF + AD + DC + α < ω2 -AD is also consistent. (shrink)

For several partial sharp functions # on the reals, we characterize in terms of determinacy, the existence of indiscernibles for several inner models of “# exists for every real r”. Let #10=1#10 be the identity function on the reals. Inductively define the partial sharp function, β#1γ+1, on the reals so that #1γ+1 =1#1γ+1 codes indiscernibles for L [#11, #12,…, #1γ] and #1γ+1=#1γ+1). We sho w that the existence of β#1γ follows from the determinacy of *Σ01)*+ games . Part I proves (...) the converse. (shrink)

Game theory is usually considered applied mathematics, but a few game‐theoretic results, such as Borel determinacy, were developed by mathematicians for mathematics in a broad sense. These results usually state determinacy, i.e., the existence of a winning strategy in games that involve two players and two outcomes saying who wins. In a multi‐outcome setting, the notion of winning strategy is irrelevant yet usually replaced faithfully with the notion of (pure) Nash equilibrium. This article shows that every determinacy result over an (...) arbitrary game structure, e.g., a tree, is transferable into existence of multi‐outcome (pure) Nash equilibrium over the same game structure. The equilibrium‐transfer theorem requires cardinal or order‐theoretic conditions on the strategy sets and the preferences, respectively, whereas counter‐examples show that every requirement is relevant, albeit possibly improvable. When the outcomes are finitely many, the proof provides an algorithm computing a Nash equilibrium without significant complexity loss compared to the two‐outcome case. As examples of application, this article generalises Borel determinacy, positional determinacy of parity games, and finite‐memory determinacy of Muller games. (shrink)