Bidding graph games with partially-observable budgets
Two-player zero-sum graph games are a central model, which proceeds as follows. A token is placed on a vertex of a graph, and the two players move it to produce an infinite play, which determines the winner or payoff of the game. Traditionally, the players alternate turns in moving the token. In bid...
Saved in:
Main Authors: | AVNI, Guy, JECKER, Ismael, ZIKELIC, Dorde |
---|---|
格式: | text |
語言: | English |
出版: |
Institutional Knowledge at Singapore Management University
2023
|
主題: | |
在線閱讀: | https://ink.library.smu.edu.sg/sis_research/9080 https://ink.library.smu.edu.sg/context/sis_research/article/10083/viewcontent/25679_Article_Text_29742_1_2_20230626.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Infinite-duration all-pay bidding games
由: AVNI, Guy, et al.
出版: (2021) -
Bidding mechanisms in graph games
由: AVNI, Guy, et al.
出版: (2019) -
Bidding mechanisms in graph games
由: AVNI, Guy, et al.
出版: (2021) -
Reachability Poorman discrete-bidding games
由: AVNI, Guy, et al.
出版: (2023) -
Parallel personalized pagerank on dynamic graphs
由: GUO, Wentian, et al.
出版: (2017)