{"id":"https://openalex.org/W4414232922","doi":"https://doi.org/10.4204/eptcs.428.4","title":"Sound Value Iteration for Simple Stochastic Games","display_name":"Sound Value Iteration for Simple Stochastic Games","publication_year":2025,"publication_date":"2025-09-16","ids":{"openalex":"https://openalex.org/W4414232922","doi":"https://doi.org/10.4204/eptcs.428.4"},"language":"en","primary_location":{"id":"doi:10.4204/eptcs.428.4","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.428.4","pdf_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF25.4.pdf","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF25.4.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008450911","display_name":"Muqsit Azeem","orcid":"https://orcid.org/0000-0003-4532-8344"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Muqsit Azeem","raw_affiliation_strings":["Technical University of Munich"],"affiliations":[{"raw_affiliation_string":"Technical University of Munich","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074485601","display_name":"Jan K\u0159et\u00ednsk\u00fd","orcid":"https://orcid.org/0000-0002-8122-2881"},"institutions":[{"id":"https://openalex.org/I21449261","display_name":"Masaryk University","ror":"https://ror.org/02j46qs45","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21449261"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jan Kretinsky","raw_affiliation_strings":["Masaryk University"],"affiliations":[{"raw_affiliation_string":"Masaryk University","institution_ids":["https://openalex.org/I21449261"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042375584","display_name":"Maximilian Weininger","orcid":"https://orcid.org/0000-0002-0163-2152"},"institutions":[{"id":"https://openalex.org/I904495901","display_name":"Ruhr University Bochum","ror":"https://ror.org/04tsk2644","country_code":"DE","type":"education","lineage":["https://openalex.org/I904495901"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Maximilian Weininger","raw_affiliation_strings":["Ruhr-University Bochum"],"affiliations":[{"raw_affiliation_string":"Ruhr-University Bochum","institution_ids":["https://openalex.org/I904495901"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008450911"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.24084838,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"428","issue":null,"first_page":"29","last_page":"44"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.7757999897003174,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.7757999897003174,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.7511000037193298,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.770799994468689},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.76419997215271},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5997999906539917},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5358999967575073},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.5178999900817871},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.49970000982284546},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47679999470710754},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.38659998774528503}],"concepts":[{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.770799994468689},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.76419997215271},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.602400004863739},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5997999906539917},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5960999727249146},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5358999967575073},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.5178999900817871},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.49970000982284546},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47679999470710754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4699999988079071},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.38659998774528503},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36640000343322754},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.3610999882221222},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.35510000586509705},{"id":"https://openalex.org/C17098449","wikidata":"https://www.wikidata.org/wiki/Q176814","display_name":"Partially observable Markov decision process","level":4,"score":0.3244999945163727},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.31869998574256897},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.28139999508857727},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2759999930858612},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.2750000059604645},{"id":"https://openalex.org/C52063229","wikidata":"https://www.wikidata.org/wiki/Q7246845","display_name":"Probabilistic CTL","level":4,"score":0.2590999901294708},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.2558000087738037}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4204/eptcs.428.4","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.428.4","pdf_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF25.4.pdf","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2509.14112","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2509.14112","pdf_url":"https://arxiv.org/pdf/2509.14112","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.4204/eptcs.428.4","is_oa":true,"landing_page_url":"https://doi.org/10.4204/eptcs.428.4","pdf_url":"https://eptcs.web.cse.unsw.edu.au/paper.cgi?GandALF25.4.pdf","source":{"id":"https://openalex.org/S4210216316","display_name":"Electronic Proceedings in Theoretical Computer Science","issn_l":"2075-2180","issn":["2075-2180"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310318029","host_organization_name":"Open Publishing Association","host_organization_lineage":["https://openalex.org/P4310318029"],"host_organization_lineage_names":["Open Publishing Association"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Proceedings in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1633333669","display_name":null,"funder_award_id":"427755713","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G5088867557","display_name":null,"funder_award_id":"11718","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320334322","display_name":"HORIZON EUROPE Framework Programme","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4414232922.pdf","grobid_xml":"https://content.openalex.org/works/W4414232922.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Algorithmic":[0],"analysis":[1],"of":[2,27,31,63,94,109],"Markov":[3],"decision":[4],"processes":[5],"(MDP)":[6],"and":[7,50,83],"stochastic":[8],"games":[9],"(SG)":[10],"in":[11,60,91,102],"practice":[12],"relies":[13],"on":[14,24,53,121],"value-iteration":[15],"(VI)":[16],"algorithms.Since":[17],"basic":[18],"VI":[19,32],"does":[20],"not":[21,45],"provide":[22,106],"guarantees":[23],"the":[25,28,54,61,103],"precision":[26],"result,":[29,55],"variants":[30],"have":[33],"been":[34],"proposed":[35],"that":[36],"offer":[37],"such":[38],"guarantees.In":[39],"particular,":[40],"sound":[41],"value":[42],"iteration":[43],"(SVI)":[44],"only":[46],"provides":[47],"precise":[48],"lower":[49],"upper":[51],"bounds":[52],"but":[56],"also":[57],"converges":[58],"faster":[59],"presence":[62],"probabilistic":[64,124],"cycles.Unfortunately,":[65],"it":[66],"is":[67],"neither":[68],"applicable":[69],"to":[70,73,117],"SG,":[71],"nor":[72],"MDP":[74],"with":[75,123],"end":[76,95],"components.In":[77],"this":[78],"paper,":[79],"we":[80,105,111],"extend":[81],"SVI":[82],"cover":[84],"both":[85],"cases.The":[86],"technical":[87],"challenge":[88],"consists":[89],"mainly":[90],"proper":[92],"treatment":[93],"components,":[96],"which":[97],"require":[98],"different":[99],"handling":[100],"than":[101],"literature.Moreover,":[104],"several":[107],"optimizations":[108],"SVI.Finally,":[110],"evaluate":[112],"our":[113],"prototype":[114],"implementation":[115],"experimentally":[116],"demonstrate":[118],"its":[119],"potential":[120],"systems":[122],"cycles.":[125]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}