Memoryless Determinacy of Parity and Mean Payoff Games: A Simple Proof

Theoretical Computer Science - Netherlands
doi 10.1016/s0304-3975(03)00427-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Mean-Payoff Parity Games

English

Perfect-Information Stochastic Mean-Payoff Parity Games

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

A Pseudo-Quasi-Polynomial Algorithm for Mean-Payoff Parity Games

2018English

Determinacy in Stochastic Games With Unbounded Payoff Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Mean-Payoff Games and Propositional Proofs

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2011English

A Proof of Projective Determinacy

Journal of the American Mathematical Society
MathematicsApplied Mathematics
1989English

A Proof of Projective Determinacy

Journal of the American Mathematical Society
MathematicsApplied Mathematics
1989English

Approximation Schemes for Stochastic Mean Payoff Games With Perfect Information and Few Random Positions

Algorithmica
Applied MathematicsComputer Science ApplicationsComputer Science
2017English

Determinacy Separations for Class Games

Archive for Mathematical Logic
PhilosophyLogic
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy