Complexity of the Existence of Constrained Secure Equilibria in Multi-Player Games
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916929907720192 |
|---|---|
| author | Mizuno, Hiroki Takata, Yoshiaki Seki, Hiroyuki |
| author_facet | Mizuno, Hiroki Takata, Yoshiaki Seki, Hiroyuki |
| contents | 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 player has the incentive to deviate from the strategy because no player can increase her own payoff or lower the payoff of another player. SE is a promising refinement of Nash equilibrium in which a player does not care the payoff of another player. In this paper, we discuss the decidability and complexity of the problem of deciding whether a secure equilibrium with constraints (a payoff profile specifying which players must win) exists for a given multi-player game. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_01870 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Complexity of the Existence of Constrained Secure Equilibria in Multi-Player Games Mizuno, Hiroki Takata, Yoshiaki Seki, Hiroyuki Computer Science and Game Theory Formal Languages and Automata Theory 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 player has the incentive to deviate from the strategy because no player can increase her own payoff or lower the payoff of another player. SE is a promising refinement of Nash equilibrium in which a player does not care the payoff of another player. In this paper, we discuss the decidability and complexity of the problem of deciding whether a secure equilibrium with constraints (a payoff profile specifying which players must win) exists for a given multi-player game. |
| title | Complexity of the Existence of Constrained Secure Equilibria in Multi-Player Games |
| topic | Computer Science and Game Theory Formal Languages and Automata Theory |
| url | https://arxiv.org/abs/2509.01870 |