[{"editor":[{"first_name":" ‪Nathanaël","last_name":"Fijalkow","full_name":"Fijalkow,  ‪Nathanaël"}],"author":[{"last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","first_name":"Guy"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"}],"year":"2026","day":"26","doi":"10.1017/9781009500678.022","publication_identifier":{"isbn":["9781009500685"],"eisbn":["9781009500678"]},"publisher":"Cambridge University Press","corr_author":"1","date_published":"2026-04-26T00:00:00Z","_id":"22300","abstract":[{"lang":"eng","text":"As seen in previous chapters, a graph game proceeds by placing a token on one of the vertices and allowing the players to move it throughout the graph to produce an infinite trace, which determines the winner or payoff of the game."}],"citation":{"mla":"Avni, Guy, and Thomas A. Henzinger. “Bidding Games.” <i>Games on Graphs. From Logic and Automata to Algorithms</i>, edited by  ‪Nathanaël Fijalkow, Cambridge University Press, 2026, pp. 529–69, doi:<a href=\"https://doi.org/10.1017/9781009500678.022\">10.1017/9781009500678.022</a>.","chicago":"Avni, Guy, and Thomas A Henzinger. “Bidding Games.” In <i>Games on Graphs. From Logic and Automata to Algorithms</i>, edited by  ‪Nathanaël Fijalkow, 529–69. Cambridge University Press, 2026. <a href=\"https://doi.org/10.1017/9781009500678.022\">https://doi.org/10.1017/9781009500678.022</a>.","ieee":"G. Avni and T. A. Henzinger, “Bidding Games,” in <i>Games on Graphs. From Logic and Automata to Algorithms</i>,  ‪Nathanaël Fijalkow, Ed. Cambridge University Press, 2026, pp. 529–569.","short":"G. Avni, T.A. Henzinger, in:,  ‪Nathanaël Fijalkow (Ed.), Games on Graphs. From Logic and Automata to Algorithms, Cambridge University Press, 2026, pp. 529–569.","ista":"Avni G, Henzinger TA. 2026.Bidding Games. In: Games on Graphs. From Logic and Automata to Algorithms. , 529–569.","ama":"Avni G, Henzinger TA. Bidding Games. In: Fijalkow  ‪Nathanaël, ed. <i>Games on Graphs. From Logic and Automata to Algorithms</i>. Cambridge University Press; 2026:529-569. doi:<a href=\"https://doi.org/10.1017/9781009500678.022\">10.1017/9781009500678.022</a>","apa":"Avni, G., &#38; Henzinger, T. A. (2026). Bidding Games. In  ‪Nathanaël Fijalkow (Ed.), <i>Games on Graphs. From Logic and Automata to Algorithms</i> (pp. 529–569). Cambridge University Press. <a href=\"https://doi.org/10.1017/9781009500678.022\">https://doi.org/10.1017/9781009500678.022</a>"},"title":"Bidding Games","das_tickbox":"1","OA_type":"closed access","scopus_import":"1","type":"book_chapter","page":"529-569","publication":"Games on Graphs. From Logic and Automata to Algorithms","date_updated":"2026-07-13T13:32:47Z","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"date_created":"2026-07-13T10:44:22Z","month":"04","quality_controlled":"1","oa_version":"None","publication_status":"published"}]