{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T09:25:25Z","timestamp":1773307525012,"version":"3.50.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2022,8,9]],"date-time":"2022-08-09T00:00:00Z","timestamp":1660003200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"crossref","award":["ANR-16-CE40-0007"],"award-info":[{"award-number":["ANR-16-CE40-0007"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"crossref","award":["ANR-18-CE40-0015"],"award-info":[{"award-number":["ANR-18-CE40-0015"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"crossref","award":["601148"],"award-info":[{"award-number":["601148"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Priced timed games are two-player zero-sum games played on priced timed\nautomata (whose locations and transitions are labeled by weights modelling the\ncost of spending time in a state and executing an action, respectively). The\ngoals of the players are to minimise and maximise the cost to reach a target\nlocation, respectively. We consider priced timed games with one clock and\narbitrary integer weights and show that, for an important subclass of them (the\nso-called simple priced timed games), one can compute, in pseudo-polynomial\ntime, the optimal values that the players can achieve, with their associated\noptimal strategies. As side results, we also show that one-clock priced timed\ngames are determined and that we can use our result on simple priced timed\ngames to solve the more general class of so-called negative-reset-acyclic\npriced timed games (with arbitrary integer weights and one clock). The\ndecidability status of the full class of priced timed games with one-clock and\narbitrary integer weights still remains open.<\/jats:p>","DOI":"10.46298\/lmcs-18(3:17)2022","type":"journal-article","created":{"date-parts":[[2022,8,17]],"date-time":"2022-08-17T07:31:36Z","timestamp":1660721496000},"source":"Crossref","is-referenced-by-count":0,"title":["One-Clock Priced Timed Games with Negative Weights"],"prefix":"10.46298","volume":"Volume 18, Issue 3","author":[{"given":"Thomas","family":"Brihaye","sequence":"first","affiliation":[]},{"given":"Gilles","family":"Geeraerts","sequence":"additional","affiliation":[]},{"given":"Axel","family":"Haddad","sequence":"additional","affiliation":[]},{"given":"Engel","family":"Lefaucheux","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Monmege","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2022,8,9]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/9901\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/9901\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:18:11Z","timestamp":1687292291000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/6764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,9]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-18(3:17)2022","relation":{"has-preprint":[{"id-type":"arxiv","id":"2009.03074v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2009.03074v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2009.03074v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2009.03074","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2009.03074","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,9]]},"article-number":"6764"}}