Infinite-Duration All-Pay Bidding Games

@inproceedings{Avni2021InfiniteDurationAB,
  title={Infinite-Duration All-Pay Bidding Games},
  author={Guy Avni and Isma{\"e}l Jecker and Dorde Zikelic},
  booktitle={SODA},
  year={2021}
}
A graph game is a two-player zero-sum game in which the players move a token throughout a graph to produce an infinite path, which determines the winner or payoff of the game. In "bidding games", in each turn, we hold an 'auction' (bidding) to determine which player moves the token. The players simultaneously submit bids and the higher bidder moves the token. Several different payment schemes have been considered. In "first-price" bidding, only the higher bidder pays his bid, while in "all-pay… Expand
1 Citations

Figures from this paper

References

SHOWING 1-10 OF 26 REFERENCES
Infinite-Duration Bidding Games
Bidding Mechanisms in Graph Games
All-Pay Bidding Games on Graphs
Bidding Games and Efficient Allocations
Discrete All-Pay Bidding Games
Discrete bidding games
Evolutionary dynamics of biological auctions.
...
1
2
3
...