Infinite-duration all-pay bidding games
In a two-player zero-sum graph game the players move a token throughout a graph 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, we ho...
Saved in:
Main Authors: | AVNI, Guy, JECKER, Ismäel, ZIKELIC, Dorde |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2021
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/9065 https://ink.library.smu.edu.sg/context/sis_research/article/10068/viewcontent/3458064.3458102.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Bidding graph games with partially-observable budgets
by: AVNI, Guy, et al.
Published: (2023) -
Bidding mechanisms in graph games
by: AVNI, Guy, et al.
Published: (2019) -
Bidding mechanisms in graph games
by: AVNI, Guy, et al.
Published: (2021) -
Motion-based video representation for scene change detection
by: NGO, Chong-wah, et al.
Published: (2000) -
Reachability Poorman discrete-bidding games
by: AVNI, Guy, et al.
Published: (2023)