TY - GEN
T1 - Reasoning about additional winning strategies in two-player games
AU - Malvone, Vadim
AU - Murano, Aniello
N1 - Publisher Copyright:
© Springer Nature Switzerland AG 2018.
PY - 2018/1/1
Y1 - 2018/1/1
N2 - In game theory, deciding whether a designed player wins a game corresponds to check whether he has a winning strategy. There are situations in which it is important to know whether some extra winning strategy also exists. In this paper we investigate this question over two-player turn-based games under safety and fairness objectives. We provide an automata-based technique that allows to decide in polynomial-time whether the game admits more than one winning strategy.
AB - In game theory, deciding whether a designed player wins a game corresponds to check whether he has a winning strategy. There are situations in which it is important to know whether some extra winning strategy also exists. In this paper we investigate this question over two-player turn-based games under safety and fairness objectives. We provide an automata-based technique that allows to decide in polynomial-time whether the game admits more than one winning strategy.
UR - https://www.scopus.com/pages/publications/85055543806
U2 - 10.1007/978-3-030-01713-2_12
DO - 10.1007/978-3-030-01713-2_12
M3 - Conference contribution
AN - SCOPUS:85055543806
SN - 9783030017125
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 163
EP - 171
BT - Multi-Agent Systems and Agreement Technologies - 15th European Conference, EUMAS 2017, and 5th International Conference, AT 2017, Revised Selected Papers
A2 - Belardinelli, Francesco
A2 - Argente, Estefanía
PB - Springer Verlag
T2 - 15th European Conference on Multi-Agent Systems, EUMAS 2017 and the 5th International Conference on Agreement Technologies, AT 2017
Y2 - 14 December 2017 through 15 December 2017
ER -