Project description
Winning games that never end
Infinite games can be used as formalisations for the correctness of non-terminating systems and protocols, where winning or losing is determined by long-term averages or states that appear infinitely often. Various winning conditions can be defined, and several of them have widespread applications to real-life processes. Infinite games are connected to each other, so discoveries that advance one game can apply to others. With the support of the Marie Skłodowska-Curie Actions programme, the SyGaST project will investigate recent advances in some classes of infinite games to enable insight into connections and differences between the types of infinite-duration games and potentially faster algorithms to solve them.
Objective
When trying to find errors in programs, or to show that none remain, when trying to automatically produce protocol adapters that guarantee that systems seamlessly work together, and when checking if a specifications can be implemented, algorithm that solve infinite-duration games on graphs do the lion's share of the work. These are games with winning condition that range from parity through mean- or discounted payoff to simple stochastic reachability.
These games are connected by a chain of reductions, so that the latter can be considered as a generalisation of the further, in the sense that there exists a polynomial time reduction to simple stochastic games. When a new result that improves the complexity status of one of these games appears in the literature, it is very interesting, not only from a theoretical point of view, to study whether the improvement can be transferred to another type of game. This specific goal can be achieved in two ways: by building a new optimal reduction or by transferring the algorithmic advancements into a new solver for a game with a different winning condition. This is particularly interesting for practical advancements, like exploiting dominions, and theoretical advancements, such as the introduction of quasi-polynomial time algorithms.
As these recent advances are currently only available for parity games, we will answer the question of whether these advances translate to the more general classes and investigate the more fundamental question of whether these games are inter reducible: are there backwards translations that justify to consider these games as representatives of an individual complexity class, or is there evidence that back-translations are not possible? This will allow us to uncover connections and differences between the types of infinite-duration games that can lead to the proof of equivalence or inequality of the complexity of the classes of games and to the discovery of tighter reductions and faster algorithms.
Keywords
Project’s keywords as indicated by the project coordinator. Not to be confused with the EuroSciVoc taxonomy (Fields of science)
Project’s keywords as indicated by the project coordinator. Not to be confused with the EuroSciVoc taxonomy (Fields of science)
Programme(s)
Multi-annual funding programmes that define the EU’s priorities for research and innovation.
Multi-annual funding programmes that define the EU’s priorities for research and innovation.
-
H2020-EU.1.3. - EXCELLENT SCIENCE - Marie Skłodowska-Curie Actions
MAIN PROGRAMME
See all projects funded under this programme -
H2020-EU.1.3.2. - Nurturing excellence by means of cross-border and cross-sector mobility
See all projects funded under this programme
Topic(s)
Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.
Calls for proposals are divided into topics. A topic defines a specific subject or area for which applicants can submit proposals. The description of a topic comprises its specific scope and the expected impact of the funded project.
Funding Scheme
Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.
Funding scheme (or “Type of Action”) inside a programme with common features. It specifies: the scope of what is funded; the reimbursement rate; specific evaluation criteria to qualify for funding; and the use of simplified forms of costs like lump sums.
MSCA-IF - Marie Skłodowska-Curie Individual Fellowships (IF)
See all projects funded under this funding scheme
Call for proposal
Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.
Procedure for inviting applicants to submit project proposals, with the aim of receiving EU funding.
(opens in new window) H2020-MSCA-IF-2020
See all projects funded under this callCoordinator
Net EU financial contribution. The sum of money that the participant receives, deducted by the EU contribution to its linked third party. It considers the distribution of the EU financial contribution between direct beneficiaries of the project and other types of participants, like third-party participants.
L69 7ZX LIVERPOOL
United Kingdom
The total costs incurred by this organisation to participate in the project, including direct and indirect costs. This amount is a subset of the overall project budget.