4 papers · 1 filter
Complexity of the Existence of Constrained Secure Equilibria in Multi-Player Games
Hiroki Mizuno, Yoshiaki Takata, Hiroyuki Seki
We consider a multi-player non-zero-sum turn-based game (abbreviated as multi-player game) on a finite directed graph. A secure equilibrium (SE) is a strategy profile in which no p…
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…
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…
A game-theoretic approach to indistinguishability of winning objectives as user privacy
Rindo Nakanishi, Yoshiaki Takata, Hiroyuki Seki
Game theory on graphs is a basic tool in computer science. In this paper, we propose a new game-theoretic framework for studying the privacy protection of a user who interactively…