Discrete Richman-bidding scoring games

We study zero-sum combinatorial games within the framework of so-called Richman auctions (Lazarus et al., in Games No Chance 29:439–449, 1996). We modify the alternating play scoring ruleset Cumulative Subtraction (Cohensius et al., in Electron J Combin 26(P4):52, 2019), to a discrete bidding scheme, similar to Develin and Payne (Electron J Combin 17(1):85, 2010). Players bid to move, and the player with the highest bid wins the move and hands...