A Game of Pawns
We introduce and study pawn games, a class of two-player zero-sum turn-based graph games. A turn-based graph game proceeds by placing a token on an initial vertex, and whoever controls the vertex on which the token is located, chooses its next location. This leads to a path in the graph, which deter...
Gespeichert in:
| Veröffentlicht in: | Logical methods in computer science Jg. 21, Issue 2 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Logical Methods in Computer Science e.V
01.01.2025
|
| Schlagworte: | |
| ISSN: | 1860-5974, 1860-5974 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | We introduce and study pawn games, a class of two-player zero-sum turn-based graph games. A turn-based graph game proceeds by placing a token on an initial vertex, and whoever controls the vertex on which the token is located, chooses its next location. This leads to a path in the graph, which determines the winner. Traditionally, the control of vertices is predetermined and fixed. The novelty of pawn games is that control of vertices changes dynamically throughout the game as follows. Each vertex of a pawn game is owned by a pawn. In each turn, the pawns are partitioned between the two players, and the player who controls the pawn that owns the vertex on which the token is located, chooses the next location of the token. Control of pawns changes dynamically throughout the game according to a fixed mechanism. Specifically, we define several grabbing-based mechanisms in which control of at most one pawn transfers at the end of each turn. We study the complexity of solving pawn games, where we focus on reachability objectives and parameterize the problem by the mechanism that is being used and by restrictions on pawn ownership of vertices. On the positive side, even though pawn games are exponentially-succinct turn-based games, we identify several natural classes that can be solved in PTIME. On the negative side, we identify several EXPTIME-complete classes, where our hardness proofs are based on a new class of games called Lock & Key games, which may be of independent interest. |
|---|---|
| AbstractList | We introduce and study pawn games, a class of two-player zero-sum turn-based graph games. A turn-based graph game proceeds by placing a token on an initial vertex, and whoever controls the vertex on which the token is located, chooses its next location. This leads to a path in the graph, which determines the winner. Traditionally, the control of vertices is predetermined and fixed. The novelty of pawn games is that control of vertices changes dynamically throughout the game as follows. Each vertex of a pawn game is owned by a pawn. In each turn, the pawns are partitioned between the two players, and the player who controls the pawn that owns the vertex on which the token is located, chooses the next location of the token. Control of pawns changes dynamically throughout the game according to a fixed mechanism. Specifically, we define several grabbing-based mechanisms in which control of at most one pawn transfers at the end of each turn. We study the complexity of solving pawn games, where we focus on reachability objectives and parameterize the problem by the mechanism that is being used and by restrictions on pawn ownership of vertices. On the positive side, even though pawn games are exponentially-succinct turn-based games, we identify several natural classes that can be solved in PTIME. On the negative side, we identify several EXPTIME-complete classes, where our hardness proofs are based on a new class of games called Lock & Key games, which may be of independent interest. |
| Author | Ghorpade, Pranav Guha, Shibashis Avni, Guy |
| Author_xml | – sequence: 1 givenname: Guy surname: Avni fullname: Avni, Guy – sequence: 2 givenname: Pranav surname: Ghorpade fullname: Ghorpade, Pranav – sequence: 3 givenname: Shibashis surname: Guha fullname: Guha, Shibashis |
| BookMark | eNpNkDtLA0EUhQeJYIzB2m5LLVZn7t2dh10IMQYCWmg9zOvKhuyu7ATEf28eIp7mHE7xFd8lG3V9lxi7Efy-kmD0w7YNuQRxC494BxzqMzYWWvKyNqoa_dsXbJrzhu-DKDTIMbueFUvXpqKn4tV9dfmKnZPb5jT97Ql7f1q8zZ_L9ctyNZ-ty4Bc78qaR0LwlQmGRCS5X16olHwiXlHknIJQSLVGpQxHL2LkkiBFgaQ0RJyw1Ykbe7exn0PTuuHb9q6xx6MfPqwbdk3YJutqH1JyTjupKwQySnojTZCpch497FnixApDn_OQ6I8nuD0KsgdBFoQFi_YgCH8A7elZeg |
| ContentType | Journal Article |
| DBID | AAYXX CITATION DOA |
| DOI | 10.46298/lmcs-21(2:3)2025 |
| DatabaseName | CrossRef 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 | Computer Science |
| EISSN | 1860-5974 |
| ExternalDocumentID | oai_doaj_org_article_a5bceeaa8a68432f976b969c6e4ab3b2 10_46298_lmcs_21_2_3_2025 |
| GroupedDBID | .4S .DC 29L 2WC 5GY 5VS AAFWJ AAYXX ADBBV ADMLS ADQAK AENEX AFPKN ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV CITATION EBS EJD FRP GROUPED_DOAJ J9A KQ8 MK~ ML~ M~E OK1 OVT P2P TR2 TUS XSB |
| ID | FETCH-LOGICAL-c308t-50df32b49c9f1df6b49b17eebef04fd00fc173f58377903b1dd06f2ed13f782d3 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001464356200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1860-5974 |
| IngestDate | Fri Oct 03 12:53:36 EDT 2025 Sat Nov 29 08:05:34 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c308t-50df32b49c9f1df6b49b17eebef04fd00fc173f58377903b1dd06f2ed13f782d3 |
| OpenAccessLink | https://doaj.org/article/a5bceeaa8a68432f976b969c6e4ab3b2 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_a5bceeaa8a68432f976b969c6e4ab3b2 crossref_primary_10_46298_lmcs_21_2_3_2025 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-01-01 |
| PublicationDateYYYYMMDD | 2025-01-01 |
| PublicationDate_xml | – month: 01 year: 2025 text: 2025-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Logical methods in computer science |
| PublicationYear | 2025 |
| Publisher | Logical Methods in Computer Science e.V |
| Publisher_xml | – name: Logical Methods in Computer Science e.V |
| SSID | ssj0000331826 |
| Score | 2.3266253 |
| Snippet | We introduce and study pawn games, a class of two-player zero-sum turn-based graph games. A turn-based graph game proceeds by placing a token on an initial... |
| SourceID | doaj crossref |
| SourceType | Open Website Index Database |
| SubjectTerms | computer science - computer science and game theory computer science - multiagent systems |
| Title | A Game of Pawns |
| URI | https://doaj.org/article/a5bceeaa8a68432f976b969c6e4ab3b2 |
| Volume | 21, Issue 2 |
| WOSCitedRecordID | wos001464356200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: DOA dateStart: 20040101 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: 1860-5974 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000331826 issn: 1860-5974 databaseCode: M~E dateStart: 20040101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LSwMxEA5SPHipb6wv9uBBhdDNazfxVqXVi6UHhd5CniDYrXSr3vztJtmt1JMXL2EJS0i-ITPf7A7fAHBhYqlF4KGQlVRA6gKHixohkHuskSPMMkNTs4lyPObTqZistfqKNWGNPHADXF8xHfy4UlwVnBLsQ_jUohCmcFRpopP3DaxnLZlKPpiQSJyb35i0wIL3X2emhhhd4htyFTJ-9isQren1p8Ay2gHdlhFmg2Ynu2DDVXtge9VtIWsv3z7oDrJ7NXPZ3GcT9VnVB-B5NHy6e4BtOwNoSM6XkOXWE6ypMMIj64vwpFHpAoo-p97muTeoJJ7xpAFINLI2Lzx2FhEf4rglh6BTzSt3BDIUkhBlLLeahnRAaIE8wrnVhmDjSmd64Hp1NvnWqFbIwPYTEDICITGSWBIZgeiB23j6nxej4HSaCGaQrRnkX2Y4_o9FTsBW3FDzheMUdJaLd3cGNs3H8qVenCcLh_Hxa_gNf7Kq8A |
| 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=A+Game+of+Pawns&rft.jtitle=Logical+methods+in+computer+science&rft.au=Avni%2C+Guy&rft.au=Ghorpade%2C+Pranav&rft.au=Guha%2C+Shibashis&rft.date=2025-01-01&rft.issn=1860-5974&rft.eissn=1860-5974&rft.volume=21%2C+Issue+2&rft_id=info:doi/10.46298%2Flmcs-21%282%3A3%292025&rft.externalDBID=n%2Fa&rft.externalDocID=10_46298_lmcs_21_2_3_2025 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon |