3 papers
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.FL2019
Complexity Results on Register Pushdown Automata
Ryoma Senda, Yoshiaki Takata, Hiroyuki Seki
Register pushdown automata (RPDA) is an extension of classical pushdown automata to handle data values in a restricted way. RPDA attracts attention as a model of a query language f…