Borel determinacy
From MaRDI portal
Publication:1229718
DOI10.2307/1971035zbMath0336.02049OpenAlexW4248784701WikidataQ61603592 ScholiaQ61603592MaRDI QIDQ1229718
Publication date: 1975
Published in: Annals of Mathematics. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1971035
Related Items (only showing first 100 items - show all)
On the positional determinacy of edge-labeled games ⋮ On concurrent games with payoff ⋮ The challenge of non-zero-sum stochastic games ⋮ Dominating projective sets in the Baire space ⋮ Domination games on infinite graphs ⋮ The bi-embeddability relation for finitely generated groups. II ⋮ How recent work in mathematical logic relates to the foundations of mathematics ⋮ On ultralimits of sparse graph classes ⋮ Guessing, mind-changing, and the second ambiguous class ⋮ Progress measures, immediate determinacy, and a subset construction for tree automata ⋮ Alternation and \(\omega\)-type Turing acceptors ⋮ On Borel ideals ⋮ Theories of pursuit and evasion ⋮ The axiom of determinacy and the modern development of descriptive set theory ⋮ Protocol scheduling ⋮ Alternating automata on infinite trees ⋮ The consistency strength of projective absoluteness ⋮ Mathematics as a quasi-empirical science ⋮ Mathematical problems and games ⋮ Determinization and memoryless winning strategies ⋮ On refinements of subgame perfect \(\epsilon\)-equilibrium ⋮ Games with secure equilibria ⋮ Selctive ultrafilters and homogeneity ⋮ Combinatorial problems on trees: partitions, \(\Delta\)-systems and large free subtrees ⋮ A competitive search game with a moving target ⋮ Game semantics for non-monotonic intensional logic programming ⋮ A semi-potential for finite and infinite games in extensive form ⋮ Parameterized games of perfect information ⋮ Latticed-LTL synthesis in the presence of noisy inputs ⋮ On equilibria in quantitative games with reachability/safety objectives ⋮ Topological extension of parity automata ⋮ Alternating traps in Muller and parity games ⋮ Finite-state strategies in delay games ⋮ Robust worst cases for parity games algorithms ⋮ Strongly unbounded and strongly dominating sets of reals generalized ⋮ A hierarchy of deterministic context-free \(\omega\)-languages. ⋮ A survey of stochastic \(\omega \)-regular games ⋮ Automated competitive analysis of real-time scheduling with graph games ⋮ A game-theoretic characterization of Boolean grammars ⋮ Strategically reproducible bases and the factorization property ⋮ Reasoning about graded strategy quantifiers ⋮ On Nash-solvability in pure stationary strategies of finite games with perfect information which may have cycles. ⋮ Small subspaces of \(L_p\) ⋮ An example in axiomatic set theory ⋮ Groups, graphs, languages, automata, games and second-order monadic logic ⋮ Minimal collapsing extensions of models of ZFC ⋮ Computing branching distances with quantitative games ⋮ On the necessary use of abstract set theory ⋮ The Friedman embedding theorem. ⋮ Antichains and compositional algorithms for LTL synthesis ⋮ Synthesis of opaque systems with static and dynamic masks ⋮ Model checking games for the quantitative \(\mu \)-calculus ⋮ Generating counterexamples for quantitative safety specifications in probabilistic B ⋮ Asset market games of survival: a synthesis of evolutionary and dynamic games ⋮ Equilibria in multi-player multi-outcome infinite sequential games ⋮ Polynomial-time algorithms for energy games with special weight structures ⋮ Deductive verification of alternating systems ⋮ Uncertainty aversion and rationality in games of perfect information ⋮ Games for the \(\mu\)-calculus ⋮ Solving parity games via priority promotion ⋮ Strong counterexamples to Borel hyperdeterminacy ⋮ Determinacy and extended sharp functions on the reals. II: Obtaining sharps from determinacy ⋮ Pseudopolynomial iterative algorithm to solve total-payoff games and min-cost reachability games ⋮ Strategy synthesis for multi-dimensional quantitative objectives ⋮ Quantitative fair simulation games ⋮ Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games ⋮ Doomsday equilibria for omega-regular games ⋮ Operators on \(L_{p}\) \((2<p<\infty)\) which factor through \(X_{p}\) ⋮ Subspaces and quotients of Banach spaces with shrinking unconditional bases ⋮ Pursuit-evasion games with incomplete information in discrete time ⋮ Catch games: the impact of modeling decisions ⋮ On decidability and complexity of low-dimensional robot games ⋮ Infinite sequential games with perfect but incomplete information ⋮ Game characterizations and lower cones in the Weihrauch degrees ⋮ Weighted automata on infinite words in the context of attacker-defender games ⋮ Strategy logic ⋮ Synthesizing adaptive test strategies from temporal logic specifications ⋮ Quantitative reductions and vertex-ranked infinite games ⋮ Counting branches in trees using games ⋮ Long Borel games ⋮ Synthesizing optimally resilient controllers ⋮ Surrealist landscape with figures (a survey of recent results in set theory) ⋮ Infinite games on finitely coloured graphs with applications to automata on infinite trees ⋮ Turing determinacy and the continuum hypothesis ⋮ \( \omega \)-automata ⋮ Wadge-Wagner hierarchies ⋮ Martin's conjecture and strong ergodicity ⋮ Structure of constituents of \(\Pi^ 1_ 1\)-sets ⋮ Unraveling \(\boldsymbol\Pi_1^1\) sets ⋮ The GKK algorithm is the fastest over simple mean-payoff games ⋮ Martin's game: a lower bound for the number of sets. ⋮ Maps of Borel sets ⋮ Constructions of many complicated uncountable structures and Boolean algebras ⋮ On the power of randomization in on-line algorithms ⋮ Time-aware uniformization of winning strategies ⋮ Szlenk index of \(C(K)\hat{\otimes}_\pi C(L)\) ⋮ A game theoretic analysis of the cops and robber game ⋮ On values of repeated games with signals ⋮ Backtracking games and inflationary fixed points ⋮ Games with winning conditions of high Borel complexity
This page was built for publication: Borel determinacy
