Characterizing Positionality in Games of Infinite Duration over Infinite Graphs
We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive systems. This important application motivates the question of st...
Gespeichert in:
| Veröffentlicht in: | TheoretiCS Jg. 2 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
TheoretiCS Foundation e.V
31.01.2023
|
| Schlagworte: | |
| ISSN: | 2751-4838, 2751-4838 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We study turn-based quantitative games of infinite duration opposing two
antagonistic players and played over graphs. This model is widely accepted as
providing the adequate framework for formalizing the synthesis question for
reactive systems. This important application motivates the question of strategy
complexity: which valuations (or payoff functions) admit optimal positional
strategies (without memory)? Valuations for which both players have optimal
positional strategies have been characterized by Gimbert and Zielonka for
finite graphs and by Colcombet and Niwi\'nski for infinite graphs. However, for
reactive synthesis, existence of optimal positional strategies for the opponent
(which models an antagonistic environment) is irrelevant. Despite this fact,
not much is known about valuations for which the protagonist admits optimal
positional strategies, regardless of the opponent. In this work, we
characterize valuations which admit such strategies over infinite game graphs.
Our characterization uses the vocabulary of universal graphs, which has also
proved useful in understanding recent breakthrough results regarding the
complexity of parity games. More precisely, we show that a valuation admitting
universal graphs which are monotone and well-ordered is positional over all
game graphs, and -- more surprisingly -- that the converse is also true for
valuations admitting neutral colors. We prove the applicability and elegance of
the framework by unifying a number of known positionality results, proving new
ones, and establishing closure under lexicographical products. Finally, we
discuss a class of prefix-independent positional objectives which is closed
under countable unions. |
|---|---|
| AbstractList | We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive systems. This important application motivates the question of strategy complexity: which valuations (or payoff functions) admit optimal positional strategies (without memory)? Valuations for which both players have optimal positional strategies have been characterized by Gimbert and Zielonka for finite graphs and by Colcombet and Niwi\'nski for infinite graphs. However, for reactive synthesis, existence of optimal positional strategies for the opponent (which models an antagonistic environment) is irrelevant. Despite this fact, not much is known about valuations for which the protagonist admits optimal positional strategies, regardless of the opponent. In this work, we characterize valuations which admit such strategies over infinite game graphs. Our characterization uses the vocabulary of universal graphs, which has also proved useful in understanding recent breakthrough results regarding the complexity of parity games. More precisely, we show that a valuation admitting universal graphs which are monotone and well-ordered is positional over all game graphs, and -- more surprisingly -- that the converse is also true for valuations admitting neutral colors. We prove the applicability and elegance of the framework by unifying a number of known positionality results, proving new ones, and establishing closure under lexicographical products. Finally, we discuss a class of prefix-independent positional objectives which is closed under countable unions. We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive systems. This important application motivates the question of strategy complexity: which valuations (or payoff functions) admit optimal positional strategies (without memory)? Valuations for which both players have optimal positional strategies have been characterized by Gimbert and Zielonka for finite graphs and by Colcombet and Niwi\'nski for infinite graphs. However, for reactive synthesis, existence of optimal positional strategies for the opponent (which models an antagonistic environment) is irrelevant. Despite this fact, not much is known about valuations for which the protagonist admits optimal positional strategies, regardless of the opponent. In this work, we characterize valuations which admit such strategies over infinite game graphs. Our characterization uses the vocabulary of universal graphs, which has also proved useful in understanding recent breakthrough results regarding the complexity of parity games. More precisely, we show that a valuation admitting universal graphs which are monotone and well-ordered is positional over all game graphs, and -- more surprisingly -- that the converse is also true for valuations admitting neutral colors. We prove the applicability and elegance of the framework by unifying a number of known positionality results, proving new ones, and establishing closure under lexicographical products. Finally, we discuss a class of prefix-independent positional objectives which is closed under countable unions. |
| Author | Ohlmann, Pierre |
| Author_xml | – sequence: 1 givenname: Pierre surname: Ohlmann fullname: Ohlmann, Pierre |
| BackLink | https://amu.hal.science/hal-04893930$$DView record in HAL |
| BookMark | eNpVkb1PwzAUxC0EElC6M2ZlaLH97CQeUYFSqVIZYLaeY7sxKjGyA1L560lbxMf0Tqe73_DunBx3sXOEXDI6FSVX9XXfuphcH5o85TCFI3LGK8kmoob6-I8-JeOcXyilXHEpQJ6R1azFhE3vUvgM3bp4jDn0IXa4Cf22CF0xx1eXi-iLRedDF3pX3L4n3EWK-OHSrz1P-NbmC3LicZPd-PuOyPP93dPsYbJczRezm-WkYTXAhCMyb0oPVSmV8aVBbw1IK6w0QJ0ohaiFQuuYs7SkklplTM0abivaVGhhRBYHro34ot9SeMW01RGD3hsxrTWm4R8bpxktQQqvmGuMkJ4aEIpXbJC1pCBwYF0dWC1u_qEebpZ651FRK1BAP9iQpYdsk2LOyfmfAqN6v4X-3UJz0ABflL2Azg |
| ContentType | Journal Article |
| Copyright | licence_http://creativecommons.org/publicdomain/zero |
| Copyright_xml | – notice: licence_http://creativecommons.org/publicdomain/zero |
| DBID | AAYXX CITATION 1XC VOOES DOA |
| DOI | 10.46298/theoretics.23.3 |
| DatabaseName | CrossRef Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 2751-4838 |
| ExternalDocumentID | oai_doaj_org_article_106354f91ecb45f0b34927145f85034a oai:HAL:hal-04893930v1 10_46298_theoretics_23_3 |
| GroupedDBID | AAFWJ AAYXX ADQAK AFPKN ALMA_UNASSIGNED_HOLDINGS CITATION GROUPED_DOAJ M~E 1XC VOOES |
| ID | FETCH-LOGICAL-c1833-2aa1fb6f37659bf6bafdb35d4d5b30e4644849ade1ed06050d9bb81c2d70c7ad3 |
| IEDL.DBID | DOA |
| ISSN | 2751-4838 |
| IngestDate | Tue Oct 14 19:07:15 EDT 2025 Fri Nov 07 06:37:09 EST 2025 Sat Nov 29 01:37:36 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0 licence_http://creativecommons.org/publicdomain/zero/: http://creativecommons.org/publicdomain/zero |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c1833-2aa1fb6f37659bf6bafdb35d4d5b30e4644849ade1ed06050d9bb81c2d70c7ad3 |
| OpenAccessLink | https://doaj.org/article/106354f91ecb45f0b34927145f85034a |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_106354f91ecb45f0b34927145f85034a hal_primary_oai_HAL_hal_04893930v1 crossref_primary_10_46298_theoretics_23_3 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-01-31 |
| PublicationDateYYYYMMDD | 2023-01-31 |
| PublicationDate_xml | – month: 01 year: 2023 text: 2023-01-31 day: 31 |
| PublicationDecade | 2020 |
| PublicationTitle | TheoretiCS |
| PublicationYear | 2023 |
| Publisher | TheoretiCS Foundation e.V |
| Publisher_xml | – name: TheoretiCS Foundation e.V |
| SSID | ssj0002925435 |
| Score | 2.208788 |
| Snippet | We study turn-based quantitative games of infinite duration opposing two
antagonistic players and played over graphs. This model is widely accepted as... We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as... |
| SourceID | doaj hal crossref |
| SourceType | Open Website Open Access Repository Index Database |
| SubjectTerms | Computer Science computer science - computer science and game theory computer science - logic in computer science Mathematics |
| Title | Characterizing Positionality in Games of Infinite Duration over Infinite Graphs |
| URI | https://amu.hal.science/hal-04893930 https://doaj.org/article/106354f91ecb45f0b34927145f85034a |
| Volume | 2 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2751-4838 dateEnd: 20241231 omitProxy: false ssIdentifier: ssj0002925435 issn: 2751-4838 databaseCode: DOA dateStart: 20220101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2751-4838 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002925435 issn: 2751-4838 databaseCode: M~E dateStart: 20220101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07T8MwELZQxcCCQIAoL1mIhSHFie0kHkvpAwlKB5C6RX6KLinqa2Dgt3N2-pxYWKLoFCXRXezvO-f8HUJ30gEH4amMqFVpBAhhI0UYi4AdADwlUtFMh2YTWb-fD4disNXqy9eEVfLAleNgVAMkMidiqxXjjigvp5fFcJpzQlmgRsB6tpIpPwcnwm_y5tV_SZYmIn9YbwycNhLaoDs4FOT6AV0-V6upAV06R-hwSQtxs3qdY7RnyxP01lqrKX8DwuDBssAqUGc8KnHXl7jiscPPpRt58oif5lVEsa_M3Ji7XpZ6eoo-Ou33Vi9aNkCINIw0GiVSxk6lDiYBLpRLlXRGUW6Y4YoSy3xuxYQ0NraGQF5CjFAqj3ViMqIzaegZqpXj0p4jnKogJJOpTKeM21zoWFPKLbeZMRCPOrpfuaP4qnQuCsgPguuKjeuKhBa0jh69v9bXeYXqYIC4Fcu4FX_FrY5uwds79-g1XwpvI14QR1CyiC_-40mX6MD3iPfrJjS-QrXZZG6v0b5ezEbTyU34buD4-tP-Bek5yKk |
| linkProvider | Directory of Open Access Journals |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Characterizing+Positionality+in+Games+of+Infinite+Duration+over+Infinite+Graphs&rft.jtitle=TheoretiCS&rft.au=Ohlmann%2C+Pierre&rft.date=2023-01-31&rft.pub=TheoretiCS+Foundation+e.V&rft.eissn=2751-4838&rft.volume=2&rft_id=info:doi/10.46298%2Ftheoretics.23.3&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-04893930v1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2751-4838&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2751-4838&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2751-4838&client=summon |