Reachability Poorman discrete-bidding games
We consider bidding games, a class of two-player zerosum graph games. The game proceeds as follows. Both players have bounded budgets. A token is placed on a vertex of a graph, in each turn the players simultaneously submit bids, and the higher bidder moves the token, where we break bidding ties in...
Saved in:
| Main Authors: | , , , , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2023
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/sis_research/9083 https://ink.library.smu.edu.sg/context/sis_research/article/10086/viewcontent/FAIA_372_FAIA230264.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Singapore Management University |
| 語言: | English |