Abstract
We study variations on combinatorial games in which, instead of alternating moves, the players bid with discrete bidding chips for the right to determine who moves next. We consider both symmetric and partisan games, and explore differences between discrete bidding games and Richman games, which allow real-valued bidding. Unlike Richman games, discrete bidding game variations of many familiar games, such as chess, Connect Four, and even Tic-Tac-Toe, are suitable for recreational play. We also present an analysis of Tic-Tac-Toe for both discrete and real-valued bidding.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Auction in Impartial Games;International Journal of Basic Sciences and Applied Computing;2024-03-30
2. Auction-Based Scheduling;Lecture Notes in Computer Science;2024
3. Discrete Richman-bidding scoring games;International Journal of Game Theory;2021-01-12
4. Infinite-duration Bidding Games;Journal of the ACM;2019-08-26
5. Bidding games and efficient allocations;Games and Economic Behavior;2018-11