research
∙
11/24/2022
Bidding Graph Games with Partially-Observable Budgets
Two-player zero-sum "graph games" are a central model, which proceeds as...
share
research
∙
07/15/2022
Parikh Automata over Infinite Words
Parikh automata extend finite automata by counters that can be tested fo...
research
∙
05/06/2021
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct
We study the expressiveness and succinctness of good-for-games pushdown ...
research
∙
05/12/2020
Infinite-Duration All-Pay Bidding Games
A graph game is a two-player zero-sum game in which the players move a t...
research
∙
05/29/2018
