Bidding Games
Avni G, Henzinger TA. 2026.Bidding Games. In: Games on Graphs. From Logic and Automata to Algorithms. , 529–569.
Download
No fulltext has been uploaded. References only!
Book Chapter
| Published
| English
Scopus indexed
Author
Book Editor
Fijalkow, Nathanaël
Corresponding author has ISTA affiliation
Department
Abstract
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.
Publishing Year
Date Published
2026-04-26
Book Title
Games on Graphs. From Logic and Automata to Algorithms
Publisher
Cambridge University Press
Page
529-569
ISBN
IST-REx-ID
Cite this
Avni G, Henzinger TA. Bidding Games. In: Fijalkow Nathanaël, ed. Games on Graphs. From Logic and Automata to Algorithms. Cambridge University Press; 2026:529-569. doi:10.1017/9781009500678.022
Avni, G., & Henzinger, T. A. (2026). Bidding Games. In Nathanaël Fijalkow (Ed.), Games on Graphs. From Logic and Automata to Algorithms (pp. 529–569). Cambridge University Press. https://doi.org/10.1017/9781009500678.022
Avni, Guy, and Thomas A Henzinger. “Bidding Games.” In Games on Graphs. From Logic and Automata to Algorithms, edited by Nathanaël Fijalkow, 529–69. Cambridge University Press, 2026. https://doi.org/10.1017/9781009500678.022.
G. Avni and T. A. Henzinger, “Bidding Games,” in Games on Graphs. From Logic and Automata to Algorithms, Nathanaël Fijalkow, Ed. Cambridge University Press, 2026, pp. 529–569.
Avni G, Henzinger TA. 2026.Bidding Games. In: Games on Graphs. From Logic and Automata to Algorithms. , 529–569.
Avni, Guy, and Thomas A. Henzinger. “Bidding Games.” Games on Graphs. From Logic and Automata to Algorithms, edited by Nathanaël Fijalkow, Cambridge University Press, 2026, pp. 529–69, doi:10.1017/9781009500678.022.
Google Scholar
ISBN Search