Parameterized Games and Parameterized Automata

09/10/2018
by   Arno Pauly, et al.
0

We introduce a way to parameterize automata and games on finite graphs with natural numbers. The parameters are accessed essentially by allowing counting down from the parameter value to 0 and branching depending on whether 0 has been reached. The main technical result is that in games, a player can win for some values of the parameters at all, if she can win for some values below an exponential bound. For many winning conditions, this implies decidability of any statements about a player being able to win with arbitrary quantification over the parameter values. While the result seems broadly applicable, a specific motivation comes from the study of chains of strategies in games. Chains of games were recently suggested as a means to define a rationality notion based on dominance that works well with quantitative games by Bassett, Jecker, P., Raskin and Van den Boogard. From the main result of this paper, we obtain generalizations of their decidability results with much simpler proofs. As both a core technical notion in the proof of the main result, and as a notion of potential independent interest, we look at boolean functions defined via graph game forms. Graph game forms have properties akin to monotone circuits, albeit are more concise. We raise some open questions regarding how concise they are exactly, which have a flavour similar to circuit complexity. Answers to these questions could improve the bounds in the main theorem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/13/2020

Collapsible Pushdown Parity Games

This paper studies a large class of two-player perfect-information turn-...
research
04/28/2021

One-to-Two-Player Lifting for Mildly Growing Memory

We investigate so-called "one-to-two-player lifting" theorems for infini...
research
09/10/2019

Golden games

We consider extensive form win-lose games over a complete binary-tree of...
research
05/29/2018

Beyond admissibility: Dominance between chains of strategies

Admissible strategies, i.e. those that are not dominated by any other st...
research
04/02/2022

Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs

We prove that for every 3-player (3-prover) game 𝒢 with value less than ...
research
02/09/2023

Hardness of monadic second-order formulae over succinct graphs

Our main result is a succinct counterpoint to Courcelle's meta-theorem a...
research
05/14/2023

A Unifying Formal Approach to Importance Values in Boolean Functions

Boolean functions and their representation through logics, circuits, mac...

Please sign up or login with your details

Forgot password? Click here to reset