Parity and Streett Games with Costs
- Submitting institution
-
The University of Liverpool
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 12144
- Type
- D - Journal article
- DOI
-
10.2168/LMCS-10(2:14)2014
- Title of journal
- Logical Methods in Computer Science
- Article number
- 14
- First page
- -
- Volume
- 10
- Issue
- 2
- ISSN
- 1860-5974
- Open access status
- Out of scope for open access requirements
- Month of publication
- June
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 13
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- A preliminary version of this paper with the title "Cost-Parity and Cost-Streett Games" was published at FSTTCS 2012. The paper initiated the study of parity conditions with costs, a quantitative generalisation of the standard parity condition. Follow-up work by Mogavero, Murano and Sorrentino presented a refined complexity analysis (Fundamenta Informatica 2015). Using the framework provided by this paper, many variations and generalisations were studied. Examples include Bozzelli et al. (TCS 2020), Schewe et al. (LMCS 2019), and Daviaud et al. (LICS 2018).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -