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 |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2023
|
Subjects: | |
Online Access: | 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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Infinite-duration all-pay bidding games
by: AVNI, Guy, et al.
Published: (2021) -
Bidding mechanisms in graph games
by: AVNI, Guy, et al.
Published: (2019) -
Bidding mechanisms in graph games
by: AVNI, Guy, et al.
Published: (2021) -
Reachability Poorman discrete-bidding games
by: AVNI, Guy, et al.
Published: (2023) -
Parallel personalized pagerank on dynamic graphs
by: GUO, Wentian, et al.
Published: (2017)