Log in to save to my catalogue

Computing Threshold Budgets in Discrete-Bidding Games

Computing Threshold Budgets in Discrete-Bidding Games

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2722602010

Computing Threshold Budgets in Discrete-Bidding Games

About this item

Full title

Computing Threshold Budgets in Discrete-Bidding Games

Author / Creator

Publisher

Ithaca: Cornell University Library, arXiv.org

Journal title

arXiv.org, 2024-01

Language

English

Formats

Publication information

Publisher

Ithaca: Cornell University Library, arXiv.org

More information

Scope and Contents

Contents

In a two-player zero-sum graph game, the players move a token throughout a graph to produce an infinite play, which determines the winner of the game. \emph{Bidding games} are graph games in which in each turn, an auction (bidding) determines which player moves the token: the players have budgets, and in each turn, both players simultaneously submi...

Alternative Titles

Full title

Computing Threshold Budgets in Discrete-Bidding Games

Authors, Artists and Contributors

Identifiers

Primary Identifiers

Record Identifier

TN_cdi_proquest_journals_2722602010

Permalink

https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2722602010

Other Identifiers

E-ISSN

2331-8422

How to access this item