<?xml version="1.0" encoding="UTF-8"?>

<modsCollection xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd">
<mods version="3.3">

<genre>book chapter</genre>

<titleInfo><title>Bidding Games</title></titleInfo>


<note type="publicationStatus">published</note>


<note type="qualityControlled">yes</note>

<name type="personal">
  <namePart type="given">Guy</namePart>
  <namePart type="family">Avni</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">463C8BC2-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0001-5588-8287</description></name>
<name type="personal">
  <namePart type="given">Thomas A</namePart>
  <namePart type="family">Henzinger</namePart>
  <role><roleTerm type="text">author</roleTerm> </role><identifier type="local">40876CD8-F248-11E8-B48F-1D18A9856A87</identifier><description xsi:type="identifierDefinition" type="orcid">0000-0002-2985-7724</description></name>



<name type="personal"><namePart type="given"> ‪Nathanaël</namePart><namePart type="family">Fijalkow</namePart>
  <role> <roleTerm type="text">editor</roleTerm> </role></name>




<name type="corporate">
  <namePart></namePart>
  <identifier type="local">ToHe</identifier>
  <role>
    <roleTerm type="text">department</roleTerm>
  </role>
</name>








<abstract lang="eng">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.</abstract>

<originInfo><publisher>Cambridge University Press</publisher><dateIssued encoding="w3cdtf">2026</dateIssued>
</originInfo>
<language><languageTerm authority="iso639-2b" type="code">eng</languageTerm>
</language>



<relatedItem type="host"><titleInfo><title>Games on Graphs. From Logic and Automata to Algorithms</title></titleInfo>
  <identifier type="isbn">9781009500685</identifier><identifier type="doi">10.1017/9781009500678.022</identifier>
<part><extent unit="pages">529-569</extent>
</part>
</relatedItem>


<extension>
<bibliographicCitation>
<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.</short>
<apa>Avni, G., &amp;#38; Henzinger, T. A. (2026). Bidding Games. In  ‪Nathanaël Fijalkow (Ed.), &lt;i&gt;Games on Graphs. From Logic and Automata to Algorithms&lt;/i&gt; (pp. 529–569). Cambridge University Press. &lt;a href=&quot;https://doi.org/10.1017/9781009500678.022&quot;&gt;https://doi.org/10.1017/9781009500678.022&lt;/a&gt;</apa>
<ama>Avni G, Henzinger TA. Bidding Games. In: Fijalkow  ‪Nathanaël, ed. &lt;i&gt;Games on Graphs. From Logic and Automata to Algorithms&lt;/i&gt;. Cambridge University Press; 2026:529-569. doi:&lt;a href=&quot;https://doi.org/10.1017/9781009500678.022&quot;&gt;10.1017/9781009500678.022&lt;/a&gt;</ama>
<mla>Avni, Guy, and Thomas A. Henzinger. “Bidding Games.” &lt;i&gt;Games on Graphs. From Logic and Automata to Algorithms&lt;/i&gt;, edited by  ‪Nathanaël Fijalkow, Cambridge University Press, 2026, pp. 529–69, doi:&lt;a href=&quot;https://doi.org/10.1017/9781009500678.022&quot;&gt;10.1017/9781009500678.022&lt;/a&gt;.</mla>
<ista>Avni G, Henzinger TA. 2026.Bidding Games. In: Games on Graphs. From Logic and Automata to Algorithms. , 529–569.</ista>
<chicago>Avni, Guy, and Thomas A Henzinger. “Bidding Games.” In &lt;i&gt;Games on Graphs. From Logic and Automata to Algorithms&lt;/i&gt;, edited by  ‪Nathanaël Fijalkow, 529–69. Cambridge University Press, 2026. &lt;a href=&quot;https://doi.org/10.1017/9781009500678.022&quot;&gt;https://doi.org/10.1017/9781009500678.022&lt;/a&gt;.</chicago>
<ieee>G. Avni and T. A. Henzinger, “Bidding Games,” in &lt;i&gt;Games on Graphs. From Logic and Automata to Algorithms&lt;/i&gt;,  ‪Nathanaël Fijalkow, Ed. Cambridge University Press, 2026, pp. 529–569.</ieee>
</bibliographicCitation>
</extension>
<recordInfo><recordIdentifier>22300</recordIdentifier><recordCreationDate encoding="w3cdtf">2026-07-13T10:44:22Z</recordCreationDate><recordChangeDate encoding="w3cdtf">2026-07-13T13:32:47Z</recordChangeDate>
</recordInfo>
</mods>
</modsCollection>
