article published yes Milad Aghajohari author Guy Avni author 463C8BC2-F248-11E8-B48F-1D18A9856A870000-0001-5588-8287 Thomas A Henzinger author 40876CD8-F248-11E8-B48F-1D18A9856A870000-0002-2985-7724 ToHe department Formal Methods meets Algorithmic Game Theory project Rigorous Systems Engineering project Formal methods for the design and analysis of complex systems project In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a non-terminating system and its environment. In bidding games the players bid for the right to move the token: in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Bidding games are known to have a clean and elegant mathematical structure that relies on the ability of the players to submit arbitrarily small bids. Many applications, however, require a fixed granularity for the bids, which can represent, for example, the monetary value expressed in cents. We study, for the first time, the combination of discrete-bidding and infinite-duration games. Our most important result proves that these games form a large determined subclass of concurrent games, where determinacy is the strong property that there always exists exactly one player who can guarantee winning the game. In particular, we show that, in contrast to non-discrete bidding games, the mechanism with which tied bids are resolved plays an important role in discrete-bidding games. We study several natural tie-breaking mechanisms and show that, while some do not admit determinacy, most natural mechanisms imply determinacy for every pair of initial budgets. https://research-explorer.ista.ac.at/download/10674/10690/2021_LMCS_AGHAJOHAR.pdf application/pdfno https://creativecommons.org/licenses/by/4.0/ EPI Sciences2021 eng computer sciencecomputer science and game theorylogic in computer science 1860-5974 1905.03588 00065872460001010.23638/LMCS-17(1:10)2021 17110:1-10:23 Aghajohari, Milad, et al. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1, EPI Sciences, 2021, p. 10:1-10:23, doi:<a href="https://doi.org/10.23638/LMCS-17(1:10)2021">10.23638/LMCS-17(1:10)2021</a>. Aghajohari, M., Avni, G., &#38; Henzinger, T. A. (2021). Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. EPI Sciences. <a href="https://doi.org/10.23638/LMCS-17(1:10)2021">https://doi.org/10.23638/LMCS-17(1:10)2021</a> M. Aghajohari, G. Avni, T.A. Henzinger, Logical Methods in Computer Science 17 (2021) 10:1-10:23. Aghajohari M, Avni G, Henzinger TA. Determinacy in discrete-bidding infinite-duration games. <i>Logical Methods in Computer Science</i>. 2021;17(1):10:1-10:23. doi:<a href="https://doi.org/10.23638/LMCS-17(1:10)2021">10.23638/LMCS-17(1:10)2021</a> M. Aghajohari, G. Avni, and T. A. Henzinger, “Determinacy in discrete-bidding infinite-duration games,” <i>Logical Methods in Computer Science</i>, vol. 17, no. 1. EPI Sciences, p. 10:1-10:23, 2021. Aghajohari, Milad, Guy Avni, and Thomas A Henzinger. “Determinacy in Discrete-Bidding Infinite-Duration Games.” <i>Logical Methods in Computer Science</i>. EPI Sciences, 2021. <a href="https://doi.org/10.23638/LMCS-17(1:10)2021">https://doi.org/10.23638/LMCS-17(1:10)2021</a>. Aghajohari M, Avni G, Henzinger TA. 2021. Determinacy in discrete-bidding infinite-duration games. Logical Methods in Computer Science. 17(1), 10:1-10:23. 106742022-01-25T16:32:13Z2026-07-06T13:21:45Z