Additional winning strategies in two-player games

Vadim Malvone; Aniello Murano

Additional winning strategies in two-player games

Vadim Malvone
, Aniello Murano

University of Naples Federico II

Résultats de recherche: Contribution à un journal › Article de conférence › Revue par des pairs

Résumé

We study the problem of checking whether a two-player reachability game admits more than a winning strategy. We investigate this in case of perfect and imperfect information, and, by means of an automata approach we provide a linear-time procedure and an exponential-time procedure, respectively. In both cases, the results are tight.

langue originale	Anglais
Pages (de - à)	251-256
Nombre de pages	6
journal	CEUR Workshop Proceedings
Volume	1720
état	Publié - 1 janv. 2016
Modification externe	Oui
Evénement	17th Italian Conference on Theoretical Computer Science, ICTCS 2016 - Lecce, Italie Durée: 7 sept. 2016 → 9 sept. 2016

Contient cette citation

@article{22ff28c154664af0a90ab2674ade362e,

title = "Additional winning strategies in two-player games",

abstract = "We study the problem of checking whether a two-player reachability game admits more than a winning strategy. We investigate this in case of perfect and imperfect information, and, by means of an automata approach we provide a linear-time procedure and an exponential-time procedure, respectively. In both cases, the results are tight.",

author = "Vadim Malvone and Aniello Murano",

note = "Publisher Copyright: Copyright {\textcopyright} by the paper's authors. Copying permitted for private and academic purposes.; 17th Italian Conference on Theoretical Computer Science, ICTCS 2016 ; Conference date: 07-09-2016 Through 09-09-2016",

year = "2016",

month = jan,

day = "1",

language = "English",

volume = "1720",

pages = "251--256",

journal = "CEUR Workshop Proceedings",

issn = "1613-0073",

}

TY - JOUR

T1 - Additional winning strategies in two-player games

AU - Malvone, Vadim

AU - Murano, Aniello

PY - 2016/1/1

Y1 - 2016/1/1

N2 - We study the problem of checking whether a two-player reachability game admits more than a winning strategy. We investigate this in case of perfect and imperfect information, and, by means of an automata approach we provide a linear-time procedure and an exponential-time procedure, respectively. In both cases, the results are tight.

AB - We study the problem of checking whether a two-player reachability game admits more than a winning strategy. We investigate this in case of perfect and imperfect information, and, by means of an automata approach we provide a linear-time procedure and an exponential-time procedure, respectively. In both cases, the results are tight.

M3 - Conference article

AN - SCOPUS:85007556354

SN - 1613-0073

VL - 1720

SP - 251

EP - 256

JO - CEUR Workshop Proceedings

JF - CEUR Workshop Proceedings

T2 - 17th Italian Conference on Theoretical Computer Science, ICTCS 2016

Y2 - 7 September 2016 through 9 September 2016

ER -

Additional winning strategies in two-player games

Résumé

Empreinte digitale

Contient cette citation