3 citations · 4 across the 5 of their papers we have counts for
Showing cs.GTShow all
2 papers · 1 filter
cs.GT2023
Reachability Poorman Discrete-Bidding Games
Guy Avni, Tobias Meggendorfer, Suman Sadhukhan +2
We consider {\em bidding games}, a class of two-player zero-sum {\em graph games}. The game proceeds as follows. Both players have bounded budgets. A token is placed on a vertex of…
cs.GT2019
Bidding Mechanisms in Graph Games
Guy Avni, Thomas A. Henzinger, Đorđe Žikelić
In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. We study {\em bidding games}…