---
res:
  bibo_abstract:
  - 'A graph game proceeds as follows: two players move a token through a graph to
    produce a finite or infinite path, which determines the payoff of the game. We
    study bidding games in which in each turn, an auction determines which player
    moves the token. Bidding games were largely studied in combination with two variants
    of first-price auctions called “Richman” and “poorman” bidding. We study taxman
    bidding, which span the spectrum between the two. The game is parameterized by
    a constant : portion τ of the winning bid is paid to the other player, and portion  to
    the bank. While finite-duration (reachability) taxman games have been studied
    before, we present, for the first time, results on infinite-duration taxman games:
    we unify, generalize, and simplify previous equivalences between bidding games
    and a class of stochastic games called random-turn games.@eng'
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Guy
      foaf_name: Avni, Guy
      foaf_surname: Avni
      foaf_workInfoHomepage: http://www.librecat.org/personId=463C8BC2-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0001-5588-8287
  - foaf_Person:
      foaf_givenName: Thomas A
      foaf_name: Henzinger, Thomas A
      foaf_surname: Henzinger
      foaf_workInfoHomepage: http://www.librecat.org/personId=40876CD8-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-2985-7724
  - foaf_Person:
      foaf_givenName: Đorđe
      foaf_name: Žikelić, Đorđe
      foaf_surname: Žikelić
  bibo_doi: 10.1016/j.jcss.2021.02.008
  bibo_issue: '8'
  bibo_volume: 119
  dct_date: 2021^xs_gYear
  dct_identifier:
  - UT:000634149800009
  dct_isPartOf:
  - http://id.crossref.org/issn/0022-0000
  - http://id.crossref.org/issn/1090-2724
  dct_language: eng
  dct_publisher: Elsevier@
  dct_title: Bidding mechanisms in graph games@
...