Discrete bidding games

  title={Discrete bidding games},
  author={Mike Develin and Sam Payne},
  journal={Electron. J. Comb.},
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… Expand

Figures from this paper

Bidding games and efficient allocations
It is shown that PSPEs form a semilattice, with a unique and natural Bottom Equilibrium, showing the existence of pure subgame-perfect equilibria (PSPE). Expand
Discrete Richman-bidding scoring games
It is proved that for all sufficiently large heap sizes, the equilibrium outcomes of unitary games are eventually periodic, with period 2, and it is shown that the periodicity appears at the latest for heaps of sizes quadratic in the total budget. Expand
Determinacy in Discrete-Bidding Infinite-Duration Games
This work studies the combination of discrete-bidding and infinite-duration games and proves that these games form a large determined subclass of concurrent games, where {\em determinacy} is the strong property that there always exists exactly one player who can guarantee winning the game. Expand
A Survey of Bidding Games on Graphs
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, bothExpand
Bidding Games and Efficient Allocations
It is shown that if the underlying game has the form of a binary tree, then there exists a natural PSPE with the following highly desirable properties: players' utility is weakly monotone in their budget, and a Pareto-efficient outcome is reached for any initial budget. Expand
Infinite-duration Bidding Games
The key component of the proof is a quantitative solution to strongly connected mean-payoff bidding games in which the connection with random-turn games is extended to these games, and the higher bidder pays his bid to the other player and moves the token. Expand
Infinite-Duration Bidding Games
The existence of threshold budgets are shown for a qualitative class of infinite-duration games, namely parity games, and a quantitative class, namely mean-payoff games, in which they extend the connection with random-turn games to theseGames, and construct explicit optimal strategies for both players. Expand
Infinite-Duration Poorman-Bidding Games
The properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case, and quantitative poorman games, namely poorman mean-payoff games, where they construct optimal strategies depending on the initial ratio, are presented. Expand
Endgames in bidding chess
Bidding chess is a chess variant where instead of alternating play, players bid for the opportunity to move. Generalizing a known result on so-called Richman games, we show that for a natural classExpand
Bidding Mechanisms in Graph Games
The results show that Richman bidding is the exception; namely, for every $\tau <1$, the value of the game depends on the initial ratio. Expand


Combinatorial Games under Auction Play
Abstract A Richman game is a combinatorial game in which, rather than alternating moves, the two players bid for the privilege of making the next move. The theory of such games is a hybrid betweenExpand
On numbers and games
  • R. Guy
  • Computer Science
  • Proceedings of the IEEE
  • 1978
The motivation for ONAG may have been, and perhaps was-and I would like to think that it was-the attempt to bridge the theory gap between nim-like and chess-like games. Expand
The Economist's View of Combinatorial Games
We introduce two equivalent methodologies for defining and computing a position’s mean (value of playing Black rather than White) and temperature (value of next move). Both methodologies apply inExpand
Random-Turn Hex and Other Selection Games
The optimal strategy is described and the expected length of the game under optimal play for Random-Turn Hex and several other selection games is studied. Expand
Artificial intelligence for Bidding Hex
A Monte Carlo algorithm is presented for efficiently finding near optimal moves and bids in the game of Bidding Hex based on the recent solution of Random-Turn Hex by Peres, Schramm, Sheffield, and Wilson. Expand
Games of No Chance 3: Surveys
This fascinating look at combinatorial games, that is, games not involving chance or hidden information, offers updates on standard games such as Go and Hex, plus analyses of the complexity of some games and puzzles and surveys on algorithmic game theory, on playing to lose, and on coping with cycles. Expand
Bidding Chess
at an otherwise respectable educational institution. SP’s friend Ed had just returned from Turkey with a bottle of the good stuff. We were two and a half sheets to the wind, feeling oppressed by theExpand
the electronic journal of combinatorics
  • the electronic journal of combinatorics
  • 2010
Artificial intelligence for Bidding Hex, To appear in Games of no chance
  • Artificial intelligence for Bidding Hex, To appear in Games of no chance
  • 2008
Isolated pawns
  • Variant Chess
  • 2008