Hiding actions in concurrent games

Vadim Malvone; Aniello Murano; Loredana Sorrentino

doi:10.3233/978-1-61499-672-9-1686

Hiding actions in concurrent games

Vadim Malvone, Aniello Murano, Loredana Sorrentino

University of Naples Federico II

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

We study a class of determined two-player reachability games, played by Player0 and Player1 under imperfect information. Precisely, we consider the case in which Player0 wins the game if Player₁ cannot prevent him from reaching a target state. We show that the problem of deciding such a game is ExpTime-complete.

Original language	English
Title of host publication	Frontiers in Artificial Intelligence and Applications
Editors	Gal A. Kaminka, Maria Fox, Paolo Bouquet, Eyke Hullermeier, Virginia Dignum, Frank Dignum, Frank van Harmelen
Publisher	IOS Press BV
Pages	1686-1687
Number of pages	2
ISBN (Electronic)	9781614996712
DOIs	https://doi.org/10.3233/978-1-61499-672-9-1686
Publication status	Published - 1 Jan 2016
Externally published	Yes
Event	22nd European Conference on Artificial Intelligence, ECAI 2016 - The Hague, Netherlands Duration: 29 Aug 2016 → 2 Sept 2016

Publication series

Name	Frontiers in Artificial Intelligence and Applications
Volume	285
ISSN (Print)	0922-6389
ISSN (Electronic)	1879-8314

Conference

Conference	22nd European Conference on Artificial Intelligence, ECAI 2016
Country/Territory	Netherlands
City	The Hague
Period	29/08/16 → 2/09/16

Access to Document

10.3233/978-1-61499-672-9-1686

Cite this

Malvone, V., Murano, A., & Sorrentino, L. (2016). Hiding actions in concurrent games. In G. A. Kaminka, M. Fox, P. Bouquet, E. Hullermeier, V. Dignum, F. Dignum, & F. van Harmelen (Eds.), Frontiers in Artificial Intelligence and Applications (pp. 1686-1687). (Frontiers in Artificial Intelligence and Applications; Vol. 285). IOS Press BV. https://doi.org/10.3233/978-1-61499-672-9-1686

@inproceedings{9538389c41af4479b9e8d93d8ea39581,

title = "Hiding actions in concurrent games",

abstract = "We study a class of determined two-player reachability games, played by Player0 and Player1 under imperfect information. Precisely, we consider the case in which Player0 wins the game if Player1 cannot prevent him from reaching a target state. We show that the problem of deciding such a game is ExpTime-complete.",

author = "Vadim Malvone and Aniello Murano and Loredana Sorrentino",

note = "Publisher Copyright: {\textcopyright} 2016 The Authors and IOS Press.; 22nd European Conference on Artificial Intelligence, ECAI 2016 ; Conference date: 29-08-2016 Through 02-09-2016",

year = "2016",

month = jan,

day = "1",

doi = "10.3233/978-1-61499-672-9-1686",

language = "English",

series = "Frontiers in Artificial Intelligence and Applications",

publisher = "IOS Press BV",

pages = "1686--1687",

editor = "Kaminka, \{Gal A.\} and Maria Fox and Paolo Bouquet and Eyke Hullermeier and Virginia Dignum and Frank Dignum and \{van Harmelen\}, Frank",

booktitle = "Frontiers in Artificial Intelligence and Applications",

}

Malvone, V, Murano, A & Sorrentino, L 2016, Hiding actions in concurrent games. in GA Kaminka, M Fox, P Bouquet, E Hullermeier, V Dignum, F Dignum & F van Harmelen (eds), Frontiers in Artificial Intelligence and Applications. Frontiers in Artificial Intelligence and Applications, vol. 285, IOS Press BV, pp. 1686-1687, 22nd European Conference on Artificial Intelligence, ECAI 2016, The Hague, Netherlands, 29/08/16. https://doi.org/10.3233/978-1-61499-672-9-1686

Hiding actions in concurrent games. / Malvone, Vadim; Murano, Aniello; Sorrentino, Loredana.
Frontiers in Artificial Intelligence and Applications. ed. / Gal A. Kaminka; Maria Fox; Paolo Bouquet; Eyke Hullermeier; Virginia Dignum; Frank Dignum; Frank van Harmelen. IOS Press BV, 2016. p. 1686-1687 (Frontiers in Artificial Intelligence and Applications; Vol. 285).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Hiding actions in concurrent games

AU - Malvone, Vadim

AU - Murano, Aniello

AU - Sorrentino, Loredana

PY - 2016/1/1

Y1 - 2016/1/1

N2 - We study a class of determined two-player reachability games, played by Player0 and Player1 under imperfect information. Precisely, we consider the case in which Player0 wins the game if Player1 cannot prevent him from reaching a target state. We show that the problem of deciding such a game is ExpTime-complete.

AB - We study a class of determined two-player reachability games, played by Player0 and Player1 under imperfect information. Precisely, we consider the case in which Player0 wins the game if Player1 cannot prevent him from reaching a target state. We show that the problem of deciding such a game is ExpTime-complete.

U2 - 10.3233/978-1-61499-672-9-1686

DO - 10.3233/978-1-61499-672-9-1686

M3 - Conference contribution

AN - SCOPUS:85013031042

T3 - Frontiers in Artificial Intelligence and Applications

SP - 1686

EP - 1687

BT - Frontiers in Artificial Intelligence and Applications

A2 - Kaminka, Gal A.

A2 - Fox, Maria

A2 - Bouquet, Paolo

A2 - Hullermeier, Eyke

A2 - Dignum, Virginia

A2 - Dignum, Frank

A2 - van Harmelen, Frank

PB - IOS Press BV

T2 - 22nd European Conference on Artificial Intelligence, ECAI 2016

Y2 - 29 August 2016 through 2 September 2016

ER -

Hiding actions in concurrent games

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this