Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChatterjee, Krishnendu-
dc.contributor.authorPiterman, Nir-
dc.identifier.citationJournal of Symbolic Logic, 2017, 82(2) pp. 420-452en
dc.description.abstractWe generalize winning conditions in two-player games by adding a structural acceptance condition called obligations. Obligations are orthogonal to the linear winning conditions that define whether a play is winning. Obligations are a declaration that player 0 can achieve a certain value from a configuration. If the obligation is met, the value of that configuration for player 0 is 1. We define the value in such games and show that obligation games are determined. For Markov chains with Borel objectives and obligations, and finite turn-based stochastic parity games with obligations we give an alternative and simpler characterization of the value function. Based on this simpler definition we show that the decision problem of winning finite turn-based stochastic parity games with obligations is in NP\co-NP.We also show that obligation games provide a game framework for reasoning about p-automata.en
dc.rightsCopyright © 2017, Association for Symbolic Logic. Deposited with reference to the publisher’s open access archiving policy.en
dc.titleObligation Blackwell Games and p-Automataen
dc.typeJournal Articleen
dc.description.versionPublisher Versionen
pubs.organisational-group/Organisation/COLLEGE OF SCIENCE AND ENGINEERINGen
pubs.organisational-group/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Scienceen
Appears in Collections:Published Articles, Dept. of Computer Science

Files in This Item:
File Description SizeFormat 
obligation_blackwell_games_and_pautomata.pdfPublished (publisher PDF)645.76 kBAdobe PDFView/Open

Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.