1 citations · 1 across the 6 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2026
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…
cs.GT2026
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…