{"id":"https://openalex.org/W2964123877","doi":"https://doi.org/10.4230/lipics.csl.2015.504","title":"Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability","display_name":"Weak Subgame Perfect Equilibria and their Application to Quantitative Reachability","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2964123877","doi":"https://doi.org/10.4230/lipics.csl.2015.504","mag":"2964123877"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5434","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.504","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.504","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070197309","display_name":"Thomas Brihaye","orcid":"https://orcid.org/0000-0001-5763-3130"},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Brihaye, Thomas","raw_affiliation_strings":["University of Mons, Mons, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Mons, Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018655997","display_name":"V\u00e9ronique Bruy\u00e8re","orcid":"https://orcid.org/0000-0002-9680-9140"},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Bruy\u00e8re, V\u00e9ronique","raw_affiliation_strings":["University of Mons, Mons, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Mons, Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029119260","display_name":"No\u00e9mie Meunier","orcid":null},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Meunier, No\u00e9mie","raw_affiliation_strings":["University of Mons, Mons, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Mons, Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050196522","display_name":"Jean-Fran\u00e7ois Raskin","orcid":"https://orcid.org/0000-0002-3673-1097"},"institutions":[{"id":"https://openalex.org/I132053463","display_name":"Universit\u00e9 Libre de Bruxelles","ror":"https://ror.org/01r9htc13","country_code":"BE","type":"education","lineage":["https://openalex.org/I132053463"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Raskin, Jean-Francois","raw_affiliation_strings":["Universit\u00e9 Libre de Bruxelles, Brussels, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Libre de Bruxelles, Brussels, Belgium","institution_ids":["https://openalex.org/I132053463"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4117,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75951761,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9836999773979187,"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"}},"topics":[{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9836999773979187,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9406999945640564,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8932205438613892},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8016208410263062},{"id":"https://openalex.org/keywords/subgame-perfect-equilibrium","display_name":"Subgame perfect equilibrium","score":0.7597947120666504},{"id":"https://openalex.org/keywords/folk-theorem","display_name":"Folk theorem","score":0.6776690483093262},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.5596644878387451},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5213342905044556},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.47659868001937866},{"id":"https://openalex.org/keywords/finite-set","display_name":"Finite set","score":0.4676859974861145},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.46189889311790466},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44649848341941833},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4346930682659149},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41336360573768616},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.2933550775051117},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2640817165374756},{"id":"https://openalex.org/keywords/repeated-game","display_name":"Repeated game","score":0.24028614163398743},{"id":"https://openalex.org/keywords/equilibrium-selection","display_name":"Equilibrium selection","score":0.10114353895187378}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8932205438613892},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8016208410263062},{"id":"https://openalex.org/C175983524","wikidata":"https://www.wikidata.org/wiki/Q1615834","display_name":"Subgame perfect equilibrium","level":3,"score":0.7597947120666504},{"id":"https://openalex.org/C21603316","wikidata":"https://www.wikidata.org/wiki/Q650738","display_name":"Folk theorem","level":5,"score":0.6776690483093262},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.5596644878387451},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5213342905044556},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.47659868001937866},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.4676859974861145},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.46189889311790466},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44649848341941833},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4346930682659149},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41336360573768616},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.2933550775051117},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2640817165374756},{"id":"https://openalex.org/C202556891","wikidata":"https://www.wikidata.org/wiki/Q1584646","display_name":"Repeated game","level":3,"score":0.24028614163398743},{"id":"https://openalex.org/C164407509","wikidata":"https://www.wikidata.org/wiki/Q5384490","display_name":"Equilibrium selection","level":4,"score":0.10114353895187378},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:5434","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.504","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:dipot.ulb.ac.be:2013/231302","is_oa":false,"landing_page_url":"http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/231302","pdf_url":null,"source":{"id":"https://openalex.org/S4306401063","display_name":"D\u00e9p\u00f4t institutionnel de l'Universit\u00e9 libre de Bruxelles (Universit\u00e9 Libre de Bruxelles)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I132053463","host_organization_name":"Universit\u00e9 Libre de Bruxelles","host_organization_lineage":["https://openalex.org/I132053463"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Leibniz international proceedings in informatics, 41","raw_type":"info:ulb-repo/semantics/openurl/article"},{"id":"doi:10.4230/lipics.csl.2015.504","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.csl.2015.504","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5434","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2015.504","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321390","display_name":"Fonds De La Recherche Scientifique - FNRS","ror":"https://ror.org/03q83t159"},{"id":"https://openalex.org/F4320338370","display_name":"FP7 Information and Communication Technologies","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2242511677","https://openalex.org/W2950168625","https://openalex.org/W3099063706","https://openalex.org/W3124847284","https://openalex.org/W2226183490","https://openalex.org/W2997049325","https://openalex.org/W2971802750","https://openalex.org/W2023017354","https://openalex.org/W2289135644","https://openalex.org/W2520699020","https://openalex.org/W3100946251","https://openalex.org/W3091561722","https://openalex.org/W3122906337","https://openalex.org/W2952376989","https://openalex.org/W2949121607","https://openalex.org/W2039899536","https://openalex.org/W3100866575","https://openalex.org/W3142159782","https://openalex.org/W2100485490","https://openalex.org/W1596040511"],"abstract_inverted_index":{"We":[0,58],"study":[1,60],"n-player":[2],"turn-based":[3],"games":[4,54,226],"played":[5,55],"on":[6,37,56,187,206,212],"a":[7,19,45,84,87,92,107,120,136,163,174,178,221,232],"finite":[8,88],"directed":[9],"graph.":[10],"For":[11],"each":[12,171],"play,":[13],"the":[14,28,38,51,77,104,110,117,125,133,154,160,199,207,229],"players":[15,72],"have":[16],"to":[17,24],"pay":[18],"cost":[20,175],"that":[21,115,159,170],"they":[22],"want":[23],"minimize.":[25],"Instead":[26],"of":[27,31,40,47,53,63,80,90,106,112,119,127,135,162,201,209,225,231],"well-known":[29],"notion":[30,39],"Nash":[32],"equilibrium":[33,43],"(NE),":[34],"we":[35,101,131,157,219],"focus":[36],"subgame":[41],"perfect":[42],"(SPE),":[44],"refinement":[46],"NE":[48],"well-suited":[49],"in":[50,103,198],"framework":[52],"graphs.":[57],"also":[59],"natural":[61],"variants":[62],"SPE,":[64,70,165],"named":[65],"weak":[66,121,192,234],"(resp.":[67,91],"very":[68],"weak)":[69],"where":[71],"who":[73],"deviate":[74],"cannot":[75],"use":[76],"full":[78],"class":[79,126,224],"strategies":[81],"but":[82],"only":[83],"subclass":[85],"with":[86,150,196,216],"number":[89],"unique)":[93],"deviation":[94],"step(s).":[95],"Our":[96],"results":[97],"are":[98,116],"threefold.":[99],"Firstly,":[100],"characterize":[102],"form":[105],"Folk":[108,189],"theorem":[109,190],"set":[111],"all":[113],"plays":[114],"outcome":[118],"SPE.":[122],"Secondly,":[123],"for":[124,143,191,227],"quantitative":[128,202],"reachability":[129,203],"games,":[130],"prove":[132],"existence":[134,147,161,230],"finite-memory":[137],"SPE":[138,168,235],"and":[139,205],"provide":[140,220],"an":[141,167],"algorithm":[142],"computing":[144],"it":[145],"(only":[146],"was":[148],"known":[149],"no":[151],"information":[152],"regarding":[153],"memory).":[155],"Moreover,":[156],"show":[158],"constrained":[164],"i.e.":[166],"such":[169],"player":[172],"pays":[173],"less":[176],"than":[177],"given":[179],"constant,":[180],"can":[181],"be":[182],"decided.":[183],"The":[184],"proofs":[185],"rely":[186],"our":[188],"SPEs":[193,197],"(which":[194],"coincide":[195],"case":[200],"games)":[204],"decidability":[208],"MSO":[210],"logic":[211],"infinite":[213],"words.":[214],"Finally":[215],"similar":[217],"techniques,":[218],"second":[222],"general":[223],"which":[228],"(constrained)":[233],"is":[236],"decidable.":[237]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}