---
res:
  bibo_abstract:
  - 'Two-player zero-sum "graph games" are central in logic, verification, and multi-agent
    systems. The game proceeds by placing a token on a vertex of a graph, and allowing
    the players to move it to produce an infinite path, which determines the winner
    or payoff of the game. Traditionally, the players alternate turns in moving the
    token. In "bidding games", however, the players have budgets and in each turn,
    an auction (bidding) determines which player moves the token. So far, bidding
    games have only been studied as full-information games. In this work we initiate
    the study of partial-information bidding games: we study bidding games in which
    a player''s initial budget is drawn from a known probability distribution. We
    show that while for some bidding mechanisms and objectives, it is straightforward
    to adapt the results from the full-information setting to the partial-information
    setting, for others, the analysis is significantly more challenging, requires
    new techniques, and gives rise to interesting results. Specifically, we study
    games with "mean-payoff" objectives in combination with "poorman" bidding. We
    construct optimal strategies for a partially-informed player who plays against
    a fully-informed adversary. We show that, somewhat surprisingly, the "value" under
    pure strategies does not necessarily exist in such 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: Ismael R
      foaf_name: Jecker, Ismael R
      foaf_surname: Jecker
      foaf_workInfoHomepage: http://www.librecat.org/personId=85D7C63E-7D5D-11E9-9C0F-98C4E5697425
  - foaf_Person:
      foaf_givenName: Dorde
      foaf_name: Zikelic, Dorde
      foaf_surname: Zikelic
      foaf_workInfoHomepage: http://www.librecat.org/personId=294AA7A6-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4681-1699
  bibo_doi: 10.1609/aaai.v37i5.25679
  bibo_issue: '5'
  bibo_volume: 37
  dct_date: 2023^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/9781577358800
  dct_language: eng
  dct_title: Bidding graph games with partially-observable budgets@
...