Showing 2024Show all
3 papers · 1 filter
cs.GT2024
Non-cooperative rational synthesis problem for probabilistic strategies
So Koide, Yoshiaki Takata, Hiroyuki Seki
We study the decidability and complexity of non-cooperative rational synthesis problem (abbreviated as NCRSP) for some classes of probabilistic strategies. We show that NCRSP for s…
cs.GT2024
Verification with Common Knowledge of Rationality for Graph Games
Rindo Nakanishi, Yoshiaki Takata, Hiroyuki Seki
Realizability asks whether there exists a program satisfying its specification. In this problem, we assume that each agent has her own objective and behaves rationally to satisfy h…
cs.FL2024
A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Buchi Register Automata
Yoshiaki Takata, Akira Onishi, Ryoma Senda +1
Register automaton (RA) is an extension of finite automaton for dealing with data values in an infinite domain. In the previous work, we proposed disjunctive mu-calcul…