5 citations · 13 across the 15 of their papers we have counts for
6 papers · 1 filter
Algorithms for Equilibria in Concurrent Stopping Games
Léonard Brice, Thomas A. Henzinger, K. S. Thejaswini
Concurrent games are a standard model for multi-agent systems, with Nash equilibrium as their central solution concept. The associated \emph{constrained existence problem}---does a…
Decoupled Planning for Multiple Omega-Regular Objectives
Guy Avni, Thomas A. Henzinger, Kaushik Mallik +2
We study the problem of generating paths on a graph that satisfy a collection of ω-regular objectives. We propose a decoupled framework in which each objective is assigned to an in…
Sharing The Secret: Distributed Privacy-Preserving Monitoring
Mahyar Karimi, K. S. Thejaswini, Roderick Bloem +1
In traditional runtime verification, a system is typically observed by a monolithic monitor. Enforcing privacy in such settings is computationally expensive, as it necessitates hea…
History-Deterministic Büchi Automata are Succinct
Antonio Casares, Keya Prakash, K. S. Thejaswini
We describe a history-deterministic Büchi automaton that has strictly less states than every language-equivalent deterministic Büchi automaton. This solves a problem that had been…
Randomise Alone, Reach as a Team
Léonard Brice, Thomas A. Henzinger, Alipasha Montaseri +2
We study concurrent graph games where n players cooperate against an opponent to reach a set of target states. Unlike traditional settings, we study distributed randomisation: team…
Dicey Games: Shared Sources of Randomness in Distributed Systems
Léonard Brice, Thomas A. Henzinger, K. S. Thejaswini
Consider a 4-player version of Matching Pennies where a team of three players competes against the Devil. Each player simultaneously says "Heads" or "Tails". The team wins if all f…