6 papers
A Numerical Approach to the Realizability Problems for Memoryless Nash and Epsilon Equilibria in Concurrent Multiplayer Reachability Games
Senthil Rajasekaran, Jean-François Raskin, Moshe Y. Vardi
The existence of equilibria, which is called the realizability problem in the formal methods community, for probabilistic undiscounted state-based systems has proven to be an incre…
The Stochastic Target Discounted-Sum Problem
Nathalie Bertrand, Pranav Ghorpade, Senthil Rajasekaran +2
The target discounted-sum problem (TDS) asks, given a finite integer alphabet , a rational discount factor , and a rational target , whether some infinite sequence over $Σ…
Categorizer Automata for Discounted-Sum Payoffs
Nathalie Bertrand, Pranav Ghorpade, Senthil Rajasekaran +2
Categorizing continuous data into discrete bins is a fundamental operation in artificial intelligence. We introduce the categorizer automaton, a deterministic automaton that reads…
Verification of Correlated Equilibria in Concurrent Reachability Games
Senthil Rajasekaran, Jean-François Raskin, Moshe Y. Vardi
As part of an effort to apply the rigorous guarantees of formal verification to multi-agent systems, the field of equilibrium analysis, also called rational verification, studies e…
Modeling Concurrent Multi-Agent Systems
Senthil Rajasekaran, Moshe Y. Vardi
Recent work in the field of multi-agent systems has sought to use techniques and concepts from the field of formal methods to provide rigorous theoretical analysis and guarantees o…
Verifying Equilibria in Finite-Horizon Probabilistic Concurrent Game Systems
Senthil Rajasekaran, Moshe Y. Vardi
Finite-horizon probabilistic multiagent concurrent game systems, also known as finite multiplayer stochastic games, are a well-studied model in computer science due to their abilit…