---
OA_type: closed access
_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.
article_processing_charge: No
author:
- first_name: Guy
  full_name: Avni, Guy
  id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
  last_name: Avni
  orcid: 0000-0001-5588-8287
- first_name: Thomas A
  full_name: Henzinger, Thomas A
  id: 40876CD8-F248-11E8-B48F-1D18A9856A87
  last_name: Henzinger
  orcid: 0000-0002-2985-7724
citation:
  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>
  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.
  ista: 'Avni G, Henzinger TA. 2026.Bidding Games. In: Games on Graphs. From Logic
    and Automata to Algorithms. , 529–569.'
  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>.
  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.
corr_author: '1'
das_tickbox: '1'
date_created: 2026-07-13T10:44:22Z
date_published: 2026-04-26T00:00:00Z
date_updated: 2026-07-13T13:32:47Z
day: '26'
department:
- _id: ToHe
doi: 10.1017/9781009500678.022
editor:
- first_name: ' ‪Nathanaël'
  full_name: Fijalkow,  ‪Nathanaël
  last_name: Fijalkow
language:
- iso: eng
month: '04'
oa_version: None
page: 529-569
publication: Games on Graphs. From Logic and Automata to Algorithms
publication_identifier:
  eisbn:
  - '9781009500678'
  isbn:
  - '9781009500685'
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bidding Games
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...